Search NASASearch

SEARCH · Search NASA

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 253 records · Page 14

ARCS: Agentic Retrieval-Augmented Code Synthesis with Iterative Refinement

Agentic Retrieval-Augmented Code Synthesis with Iterative RefinementIn supercomputing, efficient and optimized code generation is essential to leverage high-performance systems effectively. We have developed Agentic Retrieval-Augmented Code Synthesis (ARCS), an advanced framework for accurate, robust, and efficient code generation, completion, and translation. ARCS integrates Retrieval-Augmented Generation (RAG) with Chain-of-Thought (CoT) reasoning to systematically break down and iteratively refine complex programming tasks. An agent-based RAG mechanism retrieves relevant code snippets, while real-time execution feedback drives the synthesis of candidate solutions. This process is formalized as a state-action search tree optimization, balancing code correctness with editing efficiency. Evaluations on the Geeks4Geeks and HumanEval benchmarks demonstrate that ARCS significantly outperforms traditional prompting methods in translation and generation quality. By enabling scalable and precise code synthesis, ARCS offers transformative potential for automating and optimizing code development in supercomputing applications, enhancing computational resource utilization

Bhattarai, Manish [Los Alamos National Labs]

Verification of RESRAD-BUILD Code Version 4

This report documents the verification of the RESRAD-BUILD code, Version 4.0, which was released on December 22, 2022. Two earlier reports verifying Versions 3.0 and 3.1, respectively, were published in 2001 (Kamboj, et al. 2001) and 2003 (Tetra Tech NUS 2003). Version 4.0 of the RESRAD-BUILD code has many new features and modeling enhancements over the earlier versions, including the previously released Version 3.5. Chapter 2 of this report focuses on verifying the external dose and risk modeling for point, line, area, and volume sources, as well as for floor deposition. Besides verification, the external radiation doses calculated by RESRAD-BUILD were also benchmarked with those calculated by the MCNP code (Briemeister 1993). Section J.3 of the RESRAD-BUILD User’s Manual Vol. 1 (Yu et al. 2022) documents the results of that benchmarking effort. Chapter 3 of this report focuses on verifying the ventilation modeling, from checking the remaining source inventory, releases of radionuclides to the air, air concentrations and deposited floor concentrations over time, to the radiation dose and risk associated with inhalation, ingestion, and air submersion, with and without vacuuming. The verification efforts involve designing spreadsheets to perform calculations the same as or like those performed by the RESRAD-BUILD code and then comparing the spreadsheet results with those produced by the code. When the results agree or the differences are within acceptable range, the accuracy of model implementation in the code is verified. In addition to model implementation, the implementation of key functions and features that facilitate the modeling or the use of the code were also verified during the release testing of the code. Appendix A presents the test cases developed for these verification testing, and Appendix B presents the testing results that verify proper implementation of key functions and features.

54 ENVIRONMENTAL SCIENCES

Verification of RESRAD-OFFSITE Code (V.4)

This report documents the verification of RESRAD-OFFSITE Version 4.0 and describes, where necessary, the verification of the following: • The data comprising the standard dose and risk coefficient libraries in the RESRAD database files Master_dcf_ICRP07.mdb and Master_dcf_2k.mdb. • The extraction and transfer of the data from the selected database file to the computational code by the RESRAD-OFFSITE 4.0 interface, ResOWin.exe. • The different processes that are modeled by the main computational code in RESRAD OFFSITE 4.0, ResOMain.exe. • The data displayed in the graphical and text reports. Many verifications were performed as part of the quality assurance quality control program associated with the development and release of RESRAD-OFFSITE 4.0, namely: • developer testing, • internal independent testing, and • release testing. Some were also performed in response to questions from users regarding the performance of the code. The main text of the report focuses on summarizing a subset of those tests, both independent and developer tests that verified the computations performed by the code. The verifications included in this report served as the basis for the development of the release tests of the computational executables and provided the quantitative results to be compared with the code output. The input and output interfaces and the data transfers between the various executables of the code were tested while performing the verification testing. They were tested intentionally during release testing. This report also provides some basic information to help in understanding the activities that were verified. The report: • outlines the components of RESRAD-OFFSITE 4.0 and the interconnections between these components, • outlines the processes modeled by the computational code, • provides summary figures and tables to offer confirmation of the verification of the computational components of the code, • reproduces the verifiers’ reports, if available, in individual appendices, • refers to the previous verification report (Yu et al. 2011) for more details about some of the verifications, and • reproduces the test cases and the testers’ reports from the release testing in individual appendices, when possible.

54 ENVIRONMENTAL SCIENCES

Improving the Capabilities and Computational Efficiency of the RTE+RRTMGP Radiation Code (Final Report)

This report details progress on the RTE+RRTMGP radiation codes made during the period of performance. RTE+RRTMGP is a set of codes for computing radiative fluxes in planetary atmospheres. RRTMGP uses a k-distribution to provide an optical description (absorption and possibly Rayleigh optical depth) of the gaseous atmosphere, along with the relevant source functions, on a pre-determined spectral grid given temperatures, pressures, and gas concentration. RTE computes fluxes given spectrally-resolved optical descriptions and source functions. Spectrally-resolved fluxes are summarized (“reduced”) via a user extensible class. The initial release of the code and the design choices are described in Pincus et al. 2019; the codes are available on Github. Although RRTMGP was based on current (at the time) empirical spectroscopic data, RTE and RRTMGP were developed in large part to modernize software practices. The design focused on flexibility broadly interpreted: by separating code from data and allowing data to drive computation; in coupling to the host model (e.g. the coupling of clouds to radiative fluxes is user-controlled); with respect to programming languages (computational tasks are accessed via widely-compatible C interfaces); and with respect to hardware (the codes run on a range of CPU and GPU architectures). The code also puts an emphasis on modularity and clarity. RTE+RRTMGP v1.0 was released in September 20219. This award supported the evolution of the RTE+RRTMGP code base to support greater flexibility, accuracy, and efficiency.

54 ENVIRONMENTAL SCIENCES

MCNP® Code Version 6.3.1 Release Notes

The Monte Carlo N-Particle® (MCNP® ) code is a general-purpose, continuous-energy, generalized-geometry, time-dependent, radiation transport code developed by the MCNP development team. MCNP calculations provide predictive capabilities that can replace expensive or impossible-to-perform experiments. Specific application problems include simulations of experimental diagnostics, intrinsic radiation, radiation detection and measurement, criticality safety, nuclear threat reduction and response, radiation health protection, nuclear weapons effects, and nuclear forensics. This MCNP code, version 6.3.1, follows the MCNP6.3.0 version. Since the release of MCNP6.3.0, a variety of bug fixes and code enhancements have been completed for MCNP6.3.1. A few new features have also been added to this release to support both ongoing research and the release of the latest ENDF/B-VIII.1 nuclear data library. The MCNP code, version 6.3.1, theory and user input information is documented in MCNP® Code Version 6.3.1 Theory & User Manual, the build guidance for various platforms is documented in MCNP® Code Version 6.3.1 Build Guide, and the verification and validation testing for various application benchmark test suites is documented in MCNP® Code Version 6.3.1 Verification & Validation Testing.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

High-Temperature Gas-Cooled Reactors Multiphysics Simulation Demonstration and Code Validation

This study presents a comprehensive benchmarking and verification effort of several thermal-hydraulic and multiphysics capabilities for high-temperature gas-cooled reactor applications. The first part of this effort focuses on the running-in verification of Griffin’s multiphysics capabilities, specifically for simulating the evolution of pebble-bed reactor cores from startup to equilibrium. Since Fiscal Year 2024, improvements and enhancements have been implemented in Griffin, including simplifying the process to specify streamlines and developing the online cross-section generation capability. In the absence of validation data, code-to-code comparisons are conducted with kugelpy, showing good agreement for integral quantities like k-eff predictions and predictions for maximum power density. However, accuracy issues are noted for more detailed quantities like the spatial distribution of fission rate densities which will require further work to address. The second part of this report presents an improved System Analysis Module (SAM) core channel model where the effects of cross flow are considered during the pressurized loss of forced cooling transient, resulting in an improved agreement of the predicted pebble temperature with respect to the predictions from the SAM 2D porous media model. Additionally, the wall channeling effect due to variable porosity at the near wall region of the core is also investigated. Furthermore, to demonstrate Griffin’s online cross-section generation capability, a Multiphysics simulation is performed by coupling Griffin to the SAM core channel model. In the third part of the report, as a part of the Organisation for Economic Co-operation and Development/Nuclear Energy Agency (OECD/NEA) thermal-hydraulic code validation benchmark activity for a high-temperature gas-cooled reactor, the High Temperature Test Facility (HTTF) is investigated first using the NekRS computational fluid dynamics (CFD) code to study the flow mixing phenomenon in the lower plenum of the facility. Then, code-to-code and code-to-data comparisons are performed for Test PG27, which is a pressurized conduction cooldown (PCC) test, using five different codes by six organizations from five countries. The different simulations show good agreements in terms of the general trend but there are differences in some results such as the peak temperatures of different regions and heat removal rate.

22 GENERAL STUDIES OF NUCLEAR REACTORS

Spatial transform coding of color images.

The application of the transform-coding concept to the coding of color images represented by three primary color planes of data is discussed. The principles of spatial transform coding are reviewed and the merits of various methods of color-image representation are examined. A performance analysis is presented for the color-image transform-coding system. Results of a computer simulation of the coding system are also given. It is shown that, by transform coding, the chrominance content of a color image can be coded with an average of 1.0 bits per element or less without serious degradation. If luminance coding is also employed, the average rate reduces to about 2.0 bits per element or less.

Pratt, W. K.

Arithmetic algorithms for error-coded operands.

Arithmetic algorithms for separate and nonseparate codes are considered. The nonseparate AN code is formed when an uncoded operand X is multiplied by the check modulus A to give the coded operand AX. The separate codes are the residue code, and the inverse-residue code, which has significant advantages in fault detection of repeated-use faults. A set of algorithms for low-cost AN-coded operands is discussed together with questions of their implementation in a byte-organized arithmetic processor. Algorithms for inverse-residue coded operands of the STAR computer are also examined.

Avizienis, A.

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.

A recommended R equals 1/2, K equals 32, Quick-Look-In convolutional code for NASA use

A new R = 1/2 K = 32 quick-look-in code is described and compared to the R = 1/2 K = 32 Massey-Costello code now used in some NASA systems. The new code, has the optimum distance profile property. This new code is shown, by comparison of Fano sequential decoding performance on a simulated Gaussian noise channel, to be computationally superior to the Massey-Costello code. The new code is also shown to be superior to the Massey-Costello code according to several analytical code criteria.

Massey, J. L.

Coordinated design of coding and modulation systems

The joint optimization of the coding and modulation systems employed in telemetry systems was investigated. Emphasis was placed on formulating inner and outer coding standards used by the Goddard Spaceflight Center. Convolutional codes were found that are nearly optimum for use with Viterbi decoding in the inner coding of concatenated coding systems. A convolutional code, the unit-memory code, was discovered and is ideal for inner system usage because of its byte-oriented structure. Simulations of sequential decoding on the deep-space channel were carried out to compare directly various convolutional codes that are proposed for use in deep-space systems.

Massey, J. L.

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. Two examples are given, comparing the performance of noiseless universal syndrome-source-coding to (1) run-length coding and (2) Lynch-Davisson-Schalkwijk-Cover universal coding for an ensemble of binary memoryless sources.

Ancheta, T. C., Jr.

Some optimal partial-unit-memory codes

A class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes. These codes are optimal in the sense of having maximum free distance for given values of R, k (the number of encoder inputs), and mu (the number of encoder memory cells). Optimal codes are given for rates R = 1/4, 1/3, 1/2, and 2/3, with mu not greater than 4 and k not greater than mu + 3, whenever such a code is better than previously known codes. An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes.

Lauer, G. S.

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.

A new description of combined trellis coding with asymmetric modulation

The combination of rate k/(k+t) trellis codes with digital modulations described by an asymmetric 2 sup k+1-point signal constellation has been recently shown to yield performance improvement over the traditional symmetric constellation combined with the same trellis code. The approach taken is to specify an underlying trellis code and then map the output code symbols into the fixed signal constellation based on a rule called mapping by set partitioning. The latter process is tantamount to assigning signals from the constellation to the trellis code transitions so as to maximize the free Euclidean distance of the code. Recently, a new description of trellis codes has been given that combines the above two steps into one. The ideas introduced are further explored, placing particular emphasis on the optimization of the signal constellation asymmetry. It can be concluded that the trellis-coded amplitude modulation (AM) designs given are very close to being optimum.

Simon, M. K.

Self-synchronizing outer codes for the TDRSS decoder

In this paper, various aspects of developing a self-synchronizing coding system are discussed for NASA's TDRSS satellite system. The coding system used is a concatenation of a (2, 1, 7) inner convolutional code with a (255,223) Reed-Solomon outer code. The goal is to design the decoder in such a way that both symbol and word synchronization are achieved for the outer code without the need for any separate synchronization patten. The system proposed in this paper uses the properties of the inner (Viterbi) decoder to provide symbol synchronization for the outer code, and maintains word synchronization by making use of a coset code of the Reed-Solomon code.

Lin, S.

On codes with multi-level error-correction capabilities

In conventional coding for error control, all the information symbols of a message are regarded equally significant, and hence codes are devised to provide equal protection for each information symbol against channel errors. However, in some occasions, some information symbols in a message are more significant than the other symbols. As a result, it is desired to devise codes with multilevel error-correcting capabilities. Another situation where codes with multi-level error-correcting capabilities are desired is in broadcast communication systems. An m-user broadcast channel has one input and m outputs. The single input and each output form a component channel. The component channels may have different noise levels, and hence the messages transmitted over the component channels require different levels of protection against errors. Block codes with multi-level error-correcting capabilities are also known as unequal error protection (UEP) codes. Structural properties of these codes are derived. Based on these structural properties, two classes of UEP codes are constructed.

Lin, Shu

Lewis inverse design code (LINDES): Users manual

The method of complex characteristics and hodograph transformation for the design of shockless airfoils was introduced by Bauer, Garabedian, and Korn and has been extended by the author to design subcritical and supercritical cascades with high solidities and large inlet angles. This new capability was achieved by introducing a new conformal mapping of the hodograph domain onto an ellipse and expanding the solution in terms of Chebyshev polynomials. A new computer code, the NASA Lewis inverse design code, was developed based on this idea. This new design code is an efficient method for the design of airfoils in cascade. In particular, the design of subcritical cascades of airfoils is a very fast, robust, and versatile process. The inverse design code can be made to interact with a turbulent boundary layer calculation to obtain airfoils with no separated flows at the design condition. This report is intended to serve as a users manual for this design code. Material previously reported by the author is included here for completeness and quick access to the user. The manual contains a description of the method followed by a discussion of the design procedure and examples. The input parameters necessary to run the code are then described and their default values given. Output listings corresponding to six different blade shapes designed with the code are given, as well as the necessary input data to reproduce the computer runs. The examples have been chosen to show that a wide range of applications can be covered with the code, ranging from supercritical propeller sections to wind tunnel turning vanes that can operate with a large inlet flow angle range.

Sanz, Jose M.