Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “CODING”

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Implementation of Monte Carlo Transport in the General Relativistic SpEC Code

Neutrino transport and neutrino-matter interactions are known to play an important role in the evolution of neutron star mergers and of their post-merger remnants. Neutrinos cool remnants, drive post-merger winds, and deposit energy in the low-density polar regions where relativistic jets may eventually form. Neutrinos also modify the composition of the ejected material, impacting the outcome of nucleosynthesis in merger outflows and the properties of the optical/infrared transients that they power (kilonovae). So far, merger simulations have largely relied on approximate treatments of the neutrinos (leakage, moments) that simplify the equations of radiation transport in a way that makes simulations more affordable but also introduces unquantifiable errors in the results. To improve on these methods, we recently published a first simulation of neutron star mergers using a low-cost Monte Carlo algorithm for neutrino radiation transport. Our transport code limits costs in optically thick regions by placing a hard ceiling on the value of the absorption opacity of the fluid, yet all approximations made within the code are designed to vanish in the limit of infinite numerical resolution. We provide here an in-depth description of this algorithm, of its implementation in the SpEC merger code, and of the expected impact of our approximations in optically thick regions. We argue that the last is a subdominant source of error at the accuracy reached by current simulations and for the interactions currently included in our code. We also provide tests of the most important features of this code.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

C HIMERA : A Massively Parallel Code for Core-collapse Supernova Simulations

Herein we provide a detailed description of the C HIMERA code, a code developed to model core collapse supernovae (CCSNe) in multiple spatial dimensions. The CCSN explosion mechanism remains the subject of intense research. Progress to date demonstrates that it involves a complex interplay of neutrino production, transport, and interaction in the stellar core, three-dimensional stellar core fluid dynamics and its associated instabilities, nuclear burning, and the fundamental physics of the neutrino–stellar core weak interactions and the equations of state of all stellar core constituents—particularly, the nuclear equation of state associated with core nucleons, both free and bound in nuclei. C HIMERA , by incorporating detailed neutrino transport, realistic neutrino–matter interactions, three-dimensional hydrodynamics, realistic nuclear, leptonic, and photonic equations of state, and a nuclear reaction network, along with other refinements, can be used to study the role of neutrino radiation, hydrodynamic instabilities, and a variety of input physics in the explosion mechanism itself. It can also be used to compute observables such as neutrino signatures, gravitational radiation, and the products of nucleosynthesis associated with CCSNe. The code contains modules for neutrino transport, multidimensional compressible hydrodynamics, nuclear reactions, a variety of neutrino interactions, equations of state, and modules to provide data for post-processing observables such as the products of nucleosynthesis, and gravitational radiation. C HIMERA is an evolving code, being updated periodically with improved input physics and numerical refinements. We detail here the current version of the code, from which future improvements will stem, which can in turn be described as needed in future publications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Holographic codes and bulk RG flows

We consider the coarse-graining of holographic quantum error correcting codes under a generalized notion of bulk renormalization-group flow. In particular, we study the renormalization under this flow of the $A/4G$ term in the Faulkner-Lewkowycz-Maldacena formula and in its Rényi generalization. This provides a general quantum code perspective on the arguments of Susskind and Uglum. Specifically, given a 'UV' code with two-sided recovery and appropriately flat entanglement spectrum together with a set of 'seed' states in the UV code, we explicitly construct an 'IR' code with corresponding properties which contains the given seed states and is of minimal size in a sense we describe.

FOS: Physical sciences↗
DOE OSTI2025

Urban weather modeling using WRF: linking physical assumptions, code implementation, and observational needs

The Weather Research and Forecasting (WRF) model includes urban schemes that simulate the influence of urban surfaces on the atmosphere using parameterizations for flux, and radiative exchanges. Three core schemes – the Bulk urban parameterization, Single-Layer Urban Canopy Model (SLUCM), and Multi-Layer Urban Canopy Model (MLUCM) – represent increasing levels of complexity. Although the parameterizations within these urban schemes are described in the literature, their specific implementation remains poorly documented, thus slowing down model development efforts. This manuscript provides a roadmap to the three urban schemes in WRF version 4.5.2, presenting equations using the same symbols as in the model code, along with references to code lines, and including graphics and explanations that connect the code to its physical foundations. Our thorough review of the urban parameterizations implemented in WRF version 4.5.2 highlighted a handful of parameters that may introduce discontinuities in simulations: (i) in the SLUCM, a 1 mm h −1 rain rate threshold is employed to switch between two minimum moisture availability parameterizations, thus impacting latent heat flux calculations; (ii) in the SLUCM a threshold is used to partition shortwave radiation into direct and diffuse components; (iii) in all three urban schemes, the bulk Richardson number is employed to select the similarity function, which influences the vertical distribution of heat and momentum. We also identified a highly simplified treatment of the radiative balance on roof surfaces. The implications of these simplifications can be assessed through targeted observations across relevant conditions, including varying precipitation rates, cloud cover, and transitions between stability regimes. Furthermore, the widespread application of the Monin-Obukhov similarity theory in these urban schemes warrants model evaluation under highly stable and unstable conditions and in heterogeneous urban settings with variable land cover and building heights on scales finer than model resolution. To address these challenges, we offer guidance on observational strategies, emphasizing the need for multi-parametric measurements to capture potential compensating biases and multi-height measurements that align with the levels where quantities are diagnostic and prognosed in the model (i.e., the lowest atmospheric level of the WRF model). Finally, our inspection of the code revealed implementation bugs that have now been corrected in WRF versions 4.6.0 and 4.6.1. Sensitivity tests over the Atlanta urban area show that these corrections affect surface temperatures, underscoring the importance of performing rigorous documentation and verification of the implementation of parameterizations in model code.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1971

Nonsystematic convolutional codes for sequential decoding in space applications.

Description of a class of rate 1/2 nonsystematic convolutional codes with the following desirable properties: (1) an undetected decoding error probability verified by simulation to be much smaller than for the best systematic codes of the same constraint length; (2) computation behavior with sequential decoding verified by simulation to be virtually identical to that of the best systematic codes; (3) a ?quick-look-in' feature that permits recovery of the information sequence from the hard-decisioned received data without decoding simply by modulo-two addition of the received sequences; and (4) suitability for encoding by simple circuitry requiring less hardware than encoders for the best systematic codes of the same constraint length. Theoretical analyses are given. These codes have been adopted for use in several forthcoming space missions.

Massey, J. L.↗
NASA NTRS1973

Code regenerative clean-up loop transponder for a mu-type ranging system

A loop transponder for regenerating the code of a mu type ranging system is disclosed. It includes a phase locked loop, a code generator, and a loop detector. The function of the phase locked loop is to provide phase lock between a received component wk of the range signal and a replica rafter wk of the received component, provided by the code generator. The code generator also provides a replica of the next component rafter w(w+1). The loop detector responds to wk rafler wk and rafter w(k+1) to determine when the next component w(k+1) is received and controls the code generator to supply w(k+1) to the phase locked loop and to generate a replica rafter w(k+2) of the next component.

Hurd, W. J.↗
NASA NTRS1972

Error-erasure decoding of product codes.

Two error-erasure decoding algorithms for product codes that correct all the error-erasure patterns guaranteed correctable by the minimum Hamming distance of the product code are given. The first algorithm works when at least one of the component codes is majority-logic decodable. The second algorithm works for any product code. Both algorithms use the decoders of the component codes.

Wainberg, S.↗
NASA NTRS1973

Utilization of low-redundancy convolutional codes

This paper suggests guidelines for the utilization of low-redundancy convolutional codes with emphasis on providing a quick look capability (no decoding) and a moderate amount of coding gain. The performance and implementation complexity of threshold, Viterbi, and sequential decoding when used with low-redundancy, systematic, convolutional codes is discussed. An extensive list of optimum, short constraint length codes is found for use with Viterbi decoding, and several good, long constraint length codes are found for use with sequential decoding.

Cain, J. B.↗
NASA NTRS1975

Convolutional coding techniques for data protection

Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described.

Massey, J. L.↗
NASA NTRS1974

Performance of convolutional codes on fading channels typical of planetary entry missions

The performance of convolutional codes in fading channels typical of the planetary entry channel is examined in detail. The signal fading is due primarily to turbulent atmospheric scattering of the RF signal transmitted from an entry probe through a planetary atmosphere. Short constraint length convolutional codes are considered in conjunction with binary phase-shift keyed modulation and Viterbi maximum likelihood decoding, and for longer constraint length codes sequential decoding utilizing both the Fano and Zigangirov-Jelinek (ZJ) algorithms are considered. Careful consideration is given to the modeling of the channel in terms of a few meaningful parameters which can be correlated closely with theoretical propagation studies. For short constraint length codes the bit error probability performance was investigated as a function of E sub b/N sub o parameterized by the fading channel parameters. For longer constraint length codes the effect was examined of the fading channel parameters on the computational requirements of both the Fano and ZJ algorithms. The effects of simple block interleaving in combatting the memory of the channel is explored, using the analytic approach or digital computer simulation.

Modestino, J. W.↗
NASA NTRS1975

Syndrome source coding and its universal generalization

A method of using error-correcting codes to obtain data compression, called syndrome-source-coding, is described in which the source sequence is treated as an error pattern whose syndrome forms the compressed data. It is shown that syndrome-source-coding can achieve arbitrarily small distortion with the number of compressed digits per source digit arbitrarily close to the entropy of a binary memoryless source. A universal generalization of syndrome-source-coding is formulated which provides robustly-effective, distortionless, coding of source ensembles.

Ancheta, T. C., Jr.↗
NASA NTRS1974

Convolutional code performance in fading channels

The performance of convolutional codes in fading channels typical of the planetary entry channel is examined in detail. Short constraint length codes are considered in conjunction with binary phase-shift-keyed (BPSK) modulation and Viterbi maximum likelihood decoding while for longer constraint length codes we consider sequential decoding utilizing both the Fano and Zigangirov-Jelinek (ZJ) algorithms. For short constraint length codes we are primarily interested in the bit error probability performance parameterized by the fading channel parameters. For longer constraint length codes interest will center on the effect of the fading channel parameters on the computational requirements of both the Fano and ZJ algorithms. In either case the effects of simple block interleaving in combatting the memory of the channel is thoroughly explored. The approach is analytic where possible otherwise resort is made to digital computer simulation.

Modestino, J. W.↗
NASA NTRS1974

Alternant codes

A class of codes defined by the parity check matrix of a linear code of minimum distance at least t + 1 is examined and the number of parity check symbols is discussed. Determinants of this type are known as alternants (Muir and Metzler, 1930); codes corresponding to such a matrix are termed alternant codes. The parity check matrix is obtained by restricting some of its elements to subfields of GF(q to the m-th power). Minimum distance and redundancy bounds are established for these codes, and some interesting equivalence and invariance properties are derived.

Helgert, H. J.↗
NASA NTRS1977

FORTRAN code-evaluation system

Automated code evaluation system can be used to detect coding errors and unsound coding practices in any ANSI FORTRAN IV source code before they can cause execution-time malfunctions. System concentrates on acceptable FORTRAN code features which are likely to produce undesirable results.

Capps, J. D.↗
NASA NTRS1976

An improved upper bound on the block coding error exponent for binary input discrete memoryless channels

For coded telemetry systems it is important to know the tradeoff between the error probability and the complexity of implementation. For systems using block codes, the block coding error exponent is a good way to estimate this tradeoff. The new upper bounds on the minimum distance of binary codes result in improved upper bounds on the coding error exponents for binary input memoryless channels.

Mceliece, R. J.↗
NASA NTRS1977

CAVE: A computer code for two-dimensional transient heating analysis of conceptual thermal protection systems for hypersonic vehicles

A digital computer code CAVE (Conduction Analysis Via Eigenvalues), which finds application in the analysis of two dimensional transient heating of hypersonic vehicles is described. The CAVE is written in FORTRAN 4 and is operational on both IBM 360-67 and CDC 6600 computers. The method of solution is a hybrid analytical numerical technique that is inherently stable permitting large time steps even with the best of conductors having the finest of mesh size. The aerodynamic heating boundary conditions are calculated by the code based on the input flight trajectory or can optionally be calculated external to the code and then entered as input data. The code computes the network conduction and convection links, as well as capacitance values, given basic geometrical and mesh sizes, for four generations (leading edges, cooled panels, X-24C structure and slabs). Input and output formats are presented and explained. Sample problems are included. A brief summary of the hybrid analytical-numerical technique, which utilizes eigenvalues (thermal frequencies) and eigenvectors (thermal mode vectors) is given along with aerodynamic heating equations that have been incorporated in the code and flow charts.

Rathjen, K. A.↗
NASA NTRS1977

Survey of adaptive image coding techniques

The general problem of image data compression is discussed briefly with attention given to the use of Karhunen-Loeve transforms, suboptimal systems, and block quantization. A survey is then conducted encompassing the four categories of adaptive systems: (1) adaptive transform coding (adaptive sampling, adaptive quantization, etc.), (2) adaptive predictive coding (adaptive delta modulation, adaptive DPCM encoding, etc.), (3) adaptive cluster coding (blob algorithms and the multispectral cluster coding technique), and (4) adaptive entropy coding.

Habibi, A.↗
NASA NTRS1977

The proposed coding standard at GSFC

As part of the continuing effort to introduce standardization of spacecraft and ground equipment in satellite systems, NASA's Goddard Space Flight Center and other NASA facilities have supported the development of a set of standards for the use of error control coding in telemetry subsystems. These standards are intended to ensure compatibility between spacecraft and ground encoding equipment, while allowing sufficient flexibility to meet all anticipated mission requirements. The standards which have been developed to date cover the application of block codes in error detection and error correction modes, as well as short and long constraint length convolutional codes decoded via the Viterbi and sequential decoding algorithms, respectively. Included are detailed specifications of the codes, and their implementation. Current effort is directed toward the development of standards covering channels with burst noise characteristics, channels with feedback, and code concatenation.

Morakis, J. C.↗