Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “I 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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Gamma Spectrometry Code Rodeo for Uranium Enrichment—FY 2021 Report

In FY22, the participating Department of Energy (DOE) laboratories continued the work on the project “Gamma Spectrometry Code Rodeo for Uranium Enrichment”. Oak Ridge National Laboratory (ORNL) and Lawrence Livermore National Laboratory (LLNL) continued their efforts to acquire spectra using uranium sources. A collimator (with side and back shields) was custom designed and constructed at ORNL. Spectra were acquired at ORNL using the uranium enrichment standards supplied by New Brunswick Laboratory (NBL) and the collimated M400 detector. Spectra were also acquired using steel absorbers of different thickness placed between the source and the collimated M400 detector. The plan was to ship the collimator to LLNL so that spectra could be acquired using the LLNL detector in collimated geometries. This activity was suspended since problems were noticed with the performance of the LLNL M400 detector. Also, it was brought to light to the project team that some of the aspects of the M400 detector had been updated by the vendor H3D in response to requests by the IAEA. In February 2021, the ORNL and LLNL M400 detectors were returned to the H3D factory in order to resolve the problems with the LLNL detector and to update ORNL and LLNL detectors to the same configuration as the M400 supplied to the IAEA. H3D repaired the LLNL M400 and performed the IAEA updates on both the ORNL and LLNL detectors. ORNL and LLNL received the detectors in April 2021. Data acquisition was continued using the upgraded detectors. ORNL re-collected the spectra using point sources and the NBL standards in uncollimated and collimated geometries. The collimator was shipped from ORNL to LLNL. Spectra were acquired at LLNL through Q4 of FY22. When the ORNL spectra were examined closely, it became apparent that there were spurious artifacts present in some of the spectra. This rendered suspect the ORNL spectra collected in June/July 2021 time frame. ORNL contacted H3D and per H3D’s advice, the M400 detector was returned to H3D for repairs in mid-August 2021. H3D diagnosed the problem and established that the root cause was the extra tight packaging that created a strain on the CZT crystals, causing one of them to break down. The repaired M400 was returned to ORNL in early September 2021. ORNL re-started data acquisition for the third time. Data was continued to be acquired at ORNL and LLNL through September 2021. The ORNL and LLNL data will be shared with the principal investigators from the analyzing laboratories. The GADRAS code and FRAM have been developed to have the capability to analyze the M400 spectra. Good quality spectra from FY21 have been analyzed using modified versions of GADRAS and FRAM. The spectra have also been analyzed using the GEM code. The analysis results from GADRAS, FRAM and GEM codes are presented and discussed in this report. Some preliminary results from FRAM and GEM analysis were presented in February 2021 at the U-Pu Isotopics Workshop sponsored by the IAEA. CZTU code is being modified to analyze M400 spectra. Data collection, code development and analysis will be continued in FY22 as per the FY22 Project Work Plan (PWP).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Approximate Quantum Codes From Long Wormholes

We discuss families of approximate quantum error correcting codes which arise as the nearly-degenerate ground states of certain quantum many-body Hamiltonians composed of non-commuting terms. For exact codes, the conditions for error correction can be formulated in terms of the vanishing of a two-sided mutual information in a low-temperature thermofield double state. We consider a notion of distance for approximate codes obtained by demanding that this mutual information instead be small, and we evaluate this mutual information for the SYK model and for a family of low-rank SYK models. After an extrapolation to nearly zero temperature, we find that both kinds of models produce fermionic codes with constant rate as the number, N , of fermions goes to infinity. For SYK, the distance scales as N 1 / 2 , and for low-rank SYK, the distance can be arbitrarily close to linear scaling, e.g. N .99 , while maintaining a constant rate. We also consider an analog of the no low-energy trivial states property which we dub the no low-energy adiabatically accessible states property and show that these models do have low-energy states that can be prepared adiabatically in a time that does not scale with system size N . We discuss a holographic model of these codes in which the large code distance is a consequence of the emergence of a long wormhole geometry in a simple model of quantum gravity.

Physics↗
DOE OSTI2024

The Santa Barbara Binary-disk Code Comparison

We have performed numerical calculations of a binary interacting with a gas disk, using 11 different numerical methods and a standard binary-disk setup. The goal of this study is to determine whether all codes agree on a numerically converged solution and to determine the necessary resolution for convergence and the number of binary orbits that must be computed to reach an agreed-upon relaxed state of the binary-disk system. We find that all codes can agree on a converged solution (depending on the diagnostic being measured). The zone spacing required for most codes to reach a converged measurement of the torques applied to the binary by the disk is roughly 1% of the binary separation in the vicinity of the binary components. For our disk model to reach a relaxed state, codes must be run for at least 200 binary orbits, corresponding to about a viscous time for our parameters, 0.2(a 2 Ω B /v) is the kinematic viscosity. The largest discrepancies between codes resulted from the dimensionality of the setup (3D vs. 2D disks). We find good agreement in the total torque on the binary between codes, although the partition of this torque between the gravitational torque, orbital accretion torque, and spin accretion torque depends sensitively on the sink prescriptions employed. In agreement with previous studies, we find a modest difference in torques and accretion variability between 2D and 3D disk models. We find cavity precession rates to be appreciably faster in 3D than in 2D.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1971

Arithmetic error codes - Cost and effectiveness studies for application in digital system design.

The application of error-detecting or error-correcting codes in digital computer design requires studies of cost and effectiveness tradeoffs to supplement the knowledge of their theoretical properties. General criteria for cost and effectiveness studies of error codes are developed, and results are presented for arithmetic error codes with the low-cost check modulus 2 super a - 1. Both separate (residue) and nonseparate (AN) codes are considered. The class of multiple arithmetic error codes is developed as an extension of low-cost single codes.

Avizienis, A.↗
NASA NTRS1971

Adaptive variable-length coding for efficient compression of spacecraft television data.

An adaptive variable length coding system is presented. Although developed primarily for the proposed Grand Tour missions, many features of this system clearly indicate a much wider applicability. Using sample to sample prediction, the coding system produces output rates within 0.25 bit/picture element (pixel) of the one-dimensional difference entropy for entropy values ranging from 0 to 8 bit/pixel. This is accomplished without the necessity of storing any code words. Performance improvements of 0.5 bit/pixel can be simply achieved by utilizing previous line correlation. A Basic Compressor, using concatenated codes, adapts to rapid changes in source statistics by automatically selecting one of three codes to use for each block of 21 pixels. The system adapts to less frequent, but more dramatic, changes in source statistics by adjusting the mode in which the Basic Compressor operates on a line-to-line basis. Furthermore, the compression system is independent of the quantization requirements of the pulse-code modulation system.

Rice, R. F.↗
NASA NTRS1973

The VISC code: A user's manual

The VISC code is a computer automated scheme for solving the equations describing the fully coupled viscous, radiating flow at the stagnation-point of a blunt body which may or may not be ablating. The code provides a basis for obtaining prediction of the stagnation-point heating to a body entering any planetary atmosphere at hyperbolic velocities. The code is written in FORTRAN V and is operational on both the Univac 1108 (EXEC 8) system and the CDC 7600 system. The report gives an overview of the VISC code computational logic flow, a description of the input requirements and output results and comments on the practical use of the code. As such the report forms a users manual for operation of the VISC code.

Wilson, K.↗
NASA NTRS1973

SL4 code - A user's manual

The SL-4 code is a computer automated scheme for solving the equations describing the fully-coupled viscous, radiating flow over the front face of a blunt body which may or may not be ablating. The code provides a basis for obtaining predictions of the surface beating to a body entering any planetary atmosphere at hyperbolic velocities. The code is written in FORTRAN V and is operational on both the Univac 1108 (EXEC 8) system in use at LMSC and the CDC 7600 system in use at the University of California, Berkeley. An overview of the SL-4 code computational logic flow, a description of the input requirements and output results, and comments on the practical use of the code are presented. As such this report forms a users manual for operation of the SL-4 code.

Chou, Y. S.↗
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

On the possible origin and evolution of the genetic code

The genetic code is examined for indications of possible preceding codes that existed during early evolution. Eight of the 20 amino acids are coded by 'quartets' of codons with fourfold degeneracy, and 16 such quartets can exist, so that an earlier code could have provided for 15 or 16 amino acids, rather than 20. If twofold degeneracy is postulated for the first position of the codon, there could have been ten amino acids in the code. It is speculated that these may have been phenylalanine, valine, proline, alanine, histidine, glutamine, glutanic acid, aspartic acid, cysteine and glycine. There is a notable deficiency of arginine in proteins, despite the fact that it has six codons. Simultaneously, there is more lysine in proteins than would be expected from its two codons, if the four bases in mRNA are equiprobable and are arranged randomly. It is speculated that arginine is an 'intruder' into the genetic code, and that it may have displayed another amino acid such as ornithine, or may even have displayed lysine from some of its previous codon assignments. As a result, natural selection has favored lysine against the fact that it has only two codons.

Jukes, T. H.↗
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.↗
NASA NTRS1976

Sub-baud coding

In a spread-spectrum communication system, a data sequence of +1's and -1's is expanded into a sequence of +x's (bottom bar) and -x's (bottom bar) where x (bottom bar) is a length n sequence of +1's and -1's. A sub-baud code is the assignment of a different such baud sequence to each of M users with the objective of reducing interference between users. It is shown that this interference can be described in terms of the even and odd correlation functions between pairs of sequences. A technique for deriving sub-baud codes from cyclic error-correcting codes is given, and a theorem proved which bounds the quality of the resultant code. A specific such cyclic code construction procedure is given which, for any M, yields a sub-baud code for which the mutual interference can be made arbitrarily small by choosing n sufficiently large.

Massey, J. L.↗
NASA NTRS1976

The fast decoding of Reed-Solomon codes using number theoretic transforms

It is shown that Reed-Solomon (RS) codes can be encoded and decoded by using a fast Fourier transform (FFT) algorithm over finite fields. The arithmetic utilized to perform these transforms requires only integer additions, circular shifts and a minimum number of integer multiplications. The computing time of this transform encoder-decoder for RS codes is less than the time of the standard method for RS codes. More generally, the field GF(q) is also considered, where q is a prime of the form K x 2 to the nth power + 1 and K and n are integers. GF(q) can be used to decode very long RS codes by an efficient FFT algorithm with an improvement in the number of symbols. It is shown that a radix-8 FFT algorithm over GF(q squared) can be utilized to encode and decode very long RS codes with a large number of symbols. For eight symbols in GF(q squared), this transform over GF(q squared) can be made simpler than any other known number theoretic transform with a similar capability. Of special interest is the decoding of a 16-tuple RS code with four errors.

Reed, I. S.↗
NASA NTRS1977

Comparison of convolutional and block code performance on the Rician channel

The paper is concerned with the relative performance of short constraint length convolutional codes vis-a-vis block codes when used in conjunction with either BPSK or DPSK modulation on the classical Rician fading channel. A variety of soft-decision decoding algorithms is considered for block codes while the Viterbi algorithm is used exclusively for decoding convolutional codes. Results indicate a substantial performance/complexity advantage in favor of short constraint length convolutional codes and Viterbi decoding which increases with fading severity. The work reported here extends the well-known performance advantage of convolutional codes on the AWGN channel to representative fading channels.

Mui, S. Y.↗
NASA NTRS1981

PN lock indicator for dithered PN code tracking loop

In a delay-lock one-delta (+or - 1/2 chip) dithered PN code tracking loop, an indication of lock in the PN code tracking loop is provided by delaying the dithered local PN code by a half chip to produce a +0, -1 dithered PN code that is then multiplied with the received PN-spread IF signal to produce a signal proportional to the correlation of this dithered code offset from the received code. The correlation signal is bandpass filtered, amplified with AGC control, and square-law detected to obtain a dc signal proportional to the degree of correlation. The dc signal is multiplied by the dithering control signal to effectivity substract noise voltage from the lock correlation signal which is then compared with a PN lock status signal.

Carson, L. M.↗
NASA NTRS1981

Transonic wing design using potential-flow codes - Successes and failures

The state-of-the-art of transonic wing design by use of computer codes based on the potential flow-theory is presented. The capabilities and limitations of these codes are exemplified by several experiment-theory correlations, including an assessment of pressure distribution from isolated wing and wing-body codes. Computer codes using both conservative and nonconservative differencing schemes were used, and the effects of boundary-layer corrections were considered. Results showed that calculations from a full potential, isolated code correlate well with data from an isolated wing test, but may give poor predictions of the aerodynamic characteristics of some wing-body configurations. Boundary-layer correlations were found to have only moderate effects on experiment-theory correlation. Aeroelastic effects were considered important for high aspect ratio wings of low to moderate thickness, and viscous effects were minimal for typical cruise conditions, even for Reynold's numbers as low as two million. The effect of wind-tunnel walls on experiment-theory correlations remained inconclusive. A wing-body code was used to calculate the flow field about a wing-body configuration with body-mounted engines, typical of the transonic Biz-Jet aircraft.

Hicks, R. M.↗
NASA NTRS1982

Channel coding in the space station data system network

A detailed discussion of the use of channel coding for error correction, privacy/secrecy, channel separation, and synchronization is presented. Channel coding, in one form or another, is an established and common element in data systems. No analysis and design of a major new system would fail to consider ways in which channel coding could make the system more effective. The presence of channel coding on TDRS, Shuttle, the Advanced Communication Technology Satellite Program system, the JSC-proposed Space Operations Center, and the proposed 30/20 GHz Satellite Communication System strongly support the requirement for the utilization of coding for the communications channel. The designers of the space station data system have to consider the use of channel coding.

Healy, T.↗
NASA NTRS1982

Development and application of the GIM code for the Cyber 203 computer

The GIM computer code for fluid dynamics research was developed. Enhancement of the computer code, implicit algorithm development, turbulence model implementation, chemistry model development, interactive input module coding and wing/body flowfield computation are described. The GIM quasi-parabolic code development was completed, and the code used to compute a number of example cases. Turbulence models, algebraic and differential equations, were added to the basic viscous code. An equilibrium reacting chemistry model and implicit finite difference scheme were also added. Development was completed on the interactive module for generating the input data for GIM. Solutions for inviscid hypersonic flow over a wing/body configuration are also presented.

Stainaker, J. F.↗
NASA NTRS1982

Investigation of a panel code for airframe/propeller integration analyses

The Hess panel code was investigated as a procedure to predict the aerodynamic loading associated with propeller slipstream interference on the airframe. The slipstream was modeled as a variable onset flow to the lifting and nonlifting bodies treated by the code. Four sets of experimental data were used for comparisons with the code. The results indicate that the Hess code, in its present form, will give valid solutions for nonuniform onset flows which vary in direction only. The code presently gives incorrect solutions for flows with variations in velocity. Modifications to the code to correct this are discussed.

Miley, S. J.↗