On coded partially phase-coherent communication over a Gaussian channel.
Timing error and noisy phase reference joint effect on system performance of coded partially phase coherent reception
SIGNAL TO NOISE RATIO↗
SEARCH · Search NASA
Results for “time 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.
Using a Large Language Model as a Building Block to Generate Usable Validation and Verification Suite for OpenMP
In the HPC area, both hardware and software move quickly. Often new hardware is developed and deployed, the corresponding software stack, including compilers and other tools, are under active development while leading edge software developers are working to port and tune their applications, all at the same time. While the software ecosystem is in flux, one of the key challenges for users is obtaining insight into the state of implementation of key features in the programming languages and models their applications are using – whether they have been implemented, and whether the implementation conforms to the specification, especially for newly implemented features (less tested by widespread use). OpenMP is one of the most prominent shared memory programming models used for on-node programming in HPC. With the shift towards accelerators (such as GPUs and FPGAs) and heterogeneous programming OpenMP features are getting more complex. It is natural to ask whether generative AI approaches, and large language models (LLMs) in particular, can help in producing validation and verification test suites to allow users better and faster insights into the availability and correctness of OpenMP features of interest. In this work, we explore the use of ChatGPT-4 to generate a suite of tests for OpenMP features. We have chosen a set of directives and clauses, a total of 78 combinations, which first appeared in OpenMP 3.0 (released in May 2008) but are also relevant for accelerators. We prompted ChatGPT to generate tests in the C and Fortran languages, for both host (CPU) and device (accelerator). On the Summit super-computer using the GNU implementation, we found that, of the 78 generated tests 67 C tests and 43 Fortran tests compiled successfully and fewer than those executed to completion. On further analysis we show that not all generated tests are valid. We document the process, results, and provide detailed analysis regarding the quality of tests generated. With the aim of providing input to a production quality validation and verification suite, we manually implement the corrections required to make the tests valid according to the current OpenMP specification. We quantify this effort as small, medium, or large, and record the lines of code changed to correct the invalid tests. With the corrected tests we validate recent implementations from HPE, AMD, and GNU on the Frontier supercomputer. Our experiment and subsequent analysis show that although LLMs are capable of producing HPC specific codes, they are limited by their understanding of the deeper semantics and restrictions of programming models such as OpenMP. Unsurprisingly more commonly used features have better support, while some OpenMP 3.0 directives such as sections and tasking are not universally supported on accelerators. We demonstrate that successful compilation and execution to completion are inadequate metrics for evaluating generated code and that, at this time, commodity LLMs require expert intervention for code verification. This points to gaps in the training data that is currently available for HPC. We demonstrate that with "small" effort 37% of generated invalid C tests and 63% of generated invalid Fortran tests could be corrected. This improves productivity of test generation as we circumvent writing from scratch and the common programming errors associated with it.
Pophale, Swaroop [ORNL] (ORCID:0000000185446367)↗
Navier-Stokes calculations for DFVLR F5-wing in wind tunnel using Runge-Kutta time-stepping scheme
A three-dimensional Navier-Stokes code using an explicit multistage Runge-Kutta type of time-stepping scheme is used for solving the transonic flow past a finite wing mounted inside a wind tunnel. Flow past the same wing in free air was also computed to assess the effect of wind-tunnel walls on such flows. Numerical efficiency is enhanced through vectorization of the computer code. A Cyber 205 computer with 32 million words of internal memory was used for these computations.
Vatsa, V. N.↗
Development of a shock noise prediction code for high-speed helicopters - The subsonically moving shock
A previously defined airfoil subsonic shock-noise prediction formula whose result depends on a mapping of the time-dependent shock surface to a time-independent computational domain is presently coded and incorporated in the NASA-Langley rotor-noise prediction code, WOPWOP. The structure and algorithms used in the shock-noise prediction code are presented; special care has been taken to reduce computation time while maintaining accuracy. Numerical examples of shock-noise prediction are presented for hover and forward flight. It is confirmed that shock noise is an important component of the quadrupole source.
Tadghighi, H.↗
A method for star vector determination from alignment optical telescope sighting
A method is described for determining the measured star vector in LM body coordinates when the measurement data consist of a spiral measurement, a cusor measurement, and a time associated with each measurement. The method is defined from alignment optical telescope (AOT) sightings from the LM on the lunar surface. This formulation will be coded into the real-time computer complex off-line AOT and gravity (AOT+G) bench program, the Gravity-Optics LM Attitude and Position (GOLAP) program.
Crigler, S. W.↗
Parallel algorithms and archtectures for computational structural mechanics
The determination of the fundamental (lowest) natural vibration frequencies and associated mode shapes is a key step used to uncover and correct potential failures or problem areas in most complex structures. However, the computation time taken by finite element codes to evaluate these natural frequencies is significant, often the most computationally intensive part of structural analysis calculations. There is continuing need to reduce this computation time. This study addresses this need by developing methods for parallel computation.
Patrick, Merrell↗
Static versioning in the polyhedral model
An approach is presented to enhancing the optimization process in a polyhedral compiler by introducing compile-time versioning, i.e., the production of several versions of optimized code under varying assumptions on its run-time parameters. We illustrate this process by enabling versioning in the polyhedral processor placement pass. We propose an efficient code generation method and validate that versioning can be useful in a polyhedral compiler by performing benchmarking on a small set of deep learning layers defined for dynamically-sized tensors.
Meister, Benoit J.↗
Hidden-Line Computer Code
New, efficient solution minimizes run time. Approach based on approved theorem provides formal basis for assuring generality and rapid execution. Theorem does not directly address nuisance of square law growth. Analysis of algorithm shows it tends to avoid square-law growth, and rigorous testing verified algorithm tends to enjoy almost linear growth.
Hedgley, D. R., Jr.↗
Improvements to CTF for Modeling of Boiling Water Reactor Geometry and Operating Conditions
This report documents work done to improve CTF modeling of boiling water reactor (BWR) designs during FY 2020. Several improvements were made to the geometry modeling capabilities, including adding support for modeling of inlet flow orifices, axially varying large water rods, channel boxes with large corner round radii, and quarter symmetry models. Work was also done to improve on the numerical stability and run-time performance of CTF in Virtual Environment for Reactor Applications (VERA) for core-scale BWR problems. An outer iteration loop was implemented that ensures mass and energy are conserved before moving on to the next time step in the solution. The ability to use a direct solver for the pressure matrix was also added, which reduces the matrix solution error and improves code stability and run-time performance. Improvements to the pressure balance iteration loop were needed to allow CTF to be used in a coupled VERA solution of a model of Hatch that was developed. Finally, various improvements have led to a 2×reduction in the total VERA walltime for the Hatch model.
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
The Information Length Concept Applied to Plasma Turbulence
A methodology to study statistical properties of anomalous transport in fusion plasma is investigated. Three time traces generated by the full-f gyrokinetic code GKNET are analyzed for this purpose. The time traces consist of heat flux as a function of the radial position, which is studied in a novel manner using statistical methods. The simulation data exhibit transport processes with both medium and long correlation length along the radius. A typical example of a phenomenon with long correlation length is avalanches. In order to investigate the evolution of the turbulent state, two basic configurations are studied, one flux-driven and one gradient-driven with decaying turbulence. The information length concept in tandem with Boltzmann–Gibbs and Tsallis entropy is used in the investigation. It is found that the dynamical states in both flux-driven and gradient-driven cases are surprisingly similar, but the Tsallis entropy reveals differences between them. This indicates that the types of probability distribution function are nevertheless quite different since the higher moments are significantly different.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
On the performance of Trellis coded modulation with octal phase shift keying over the TDRSS channel
As the National Aeronautics and Space Administration moves into the 21st century with programs like Space Station Freedom, a manned mission to Mars, and the new Landsat mission, transmission demands on the Tracking and Data Relay Satellite System (TDRSS) will very likely exceed the available bandwidth. The Manual Lujan, Jr. Center for Space Telemetering and Telecommunications Systems (CSTTS) at New Mexico State University (NMSU) is studying techniques for increasing the data rate capabilities of TDRSS. These techniques include the use of advanced bandwidth efficient modulation formats to increase the data rate that can be sustained in a TDRSS transponder and the use of lossless bandwidth compression of the data to be transmitted to lower the data rate required from the user spacecraft. Based upon current technology the most promising bandwidth efficient modulation technique is Trellis Coded Modulation (TCM) operating with Octal Phase shift Keying (8PSK). Trellis Coded Modulation coding with 8PSK carrier modulation has the capability to increase the data rate which can be transmitted through the TDRSS spacecraft by a factor of 2 to 2.5 times that available with todays coded QPSK systems with only a small penalty in link performance relative to the existing systems. However, before NASA can safely employ TCM coding it is necessary to prove that this complex format can perform on the real TDRSS link as it does in labs and simulation studies. This proof-of-concept test over a live satellite channel was the objective of the construction and testing performed under this task of the NMSU NASA grant referenced above. In conjunction with NASA, NMSU's CSTTS has constructed a system to test a new candidate TDRSS modulation scheme, TCM 8PSK, that can enhance the information throughput of the TDRSS spacecraft. The test system for this project which was constructed over a period of 18 months by NMSU consisted of two racks of commercial and univeristy-designed and -built equipment. This project has included modifications of an existing White Sands Ground Terminal (WSGT) High Rate QPSK Demodulator to demodulate 8PSK as well as the construction of other support hardware. Also, two TCM codecs (coder/decoders) have been constructed to implement two levels of bandwidth efficiency. One was designed and built by the research team at NMSU while the other was created by the University of Notre Dame with the University of South Australia. The NMSU codec achieves a 2-to-1 increase in data rate per unit bandwidth with a coding gain relative to QPSK of about 3dB. The Notre Dame/South Australia codec achieves a 2.5-to-1 increase in data rate per unit of occupied bandwidth and a coding gain of about 2dB.
Osborne, William P.↗
Numerical Simulation of Ion Thruster Optics
A three-dimensional simulation code (ffx) designed to analyze ion thruster optics is described. It is an extension of an earlier code and includes special features like the ability to model a wide range of grid geometries, cusp details, and mis-aligned aperture pairs to name a few. However, the principle reason for advancing the code was in the study of ion optics erosion. Ground based testing of ion thruster optics, essential to the understanding of the processes of grid erosion, can be time consuming and costly. Simulation codes that can accurately predict grid lifetimes and the physical mechanisms of grid erosion can be of great utility in the development of future ion thruster optics designed for more ambitious applications. Results of simulations are presented that describe wear profiles for several standard and nonstandard aperture geometries, such as those grid sets with square- or slotted-hole layout patterns. The goal of this paper will be to introduce the methods employed in the ffx code and to briefly demonstrate their use.
Rawlin, Vincent K.↗
Simulations of plasma current induced by toroidal field ramping down on tokamaks
In tokamak experiments, the BT ramping down can drive off-axis and parallel inductive current. This approach leads to a decrease in q95 and an increase in normalized beta, βN. The off-axis inductive current also broadens the current profile. Typically, the 1.5D transport code is used to simulate the time evolution of the plasma current profile, which is based on the flux-surface-averaged Faraday’s law. The ONETWO code is one of those transport codes. However, this code cannot simulate the situation of the evolving toroidal field BT. This article proposes a new time-dependent model to take into account the BT ramping down situation. A modified formula of flux-surface-averaged Faraday’s law was derived to consider the effect of the BT ramping rate on the current evolution, and it was implemented in the ONETWO code. Then, the modified ONETWO code was used to simulate the BT ramping down experiment on DIII-D. The simulation result of the plasma current evolution with BT ramping down shows a broader current profile with smaller ohmic current induced by the poloidal field, compared to that without BT ramping down.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Testing and Troubleshooting Automatically Generated Source Code
Tools allowing engineers to model the real-time behavior of systems that control many types of NASA systems have become widespread. These tools automatically generate source code that is compiled, linked, then downloaded into computers controlling everything from wind tunnels to space flight systems. These tools save hundreds of hours of software development time and allow engineers with thorough application area knowledge but little software development experience to generate software to control the systems they use daily. These systems are verified and validated by simulating the real-time models, and by other techniques that focus on the model or the hardware. The automatically generated source code is typically not subjected to rigorous testing using conventional software testing techniques. Given the criticality and safety issues surrounding these systems, the application of conventional and new software testing and troubleshooting techniques to the automatically generated will improve the reliability of the resulting systems.
Henry, Joel↗
System statistical reliability model and analysis
A digital computer code was developed to simulate the time-dependent behavior of the 5-kwe reactor thermoelectric system. The code was used to determine lifetime sensitivity coefficients for a number of system design parameters, such as thermoelectric module efficiency and degradation rate, radiator absorptivity and emissivity, fuel element barrier defect constant, beginning-of-life reactivity, etc. A probability distribution (mean and standard deviation) was estimated for each of these design parameters. Then, error analysis was used to obtain a probability distribution for the system lifetime (mean = 7.7 years, standard deviation = 1.1 years). From this, the probability that the system will achieve the design goal of 5 years lifetime is 0.993. This value represents an estimate of the degradation reliability of the system.
Lekach, V. S.↗
Frequency-hopping codes for multiple-access channels - A geometric approach
Basic notions pertinent to code-division multiple-user communication signals are defined in set-theoretic terms. A general treatment of composition codes by identifying a time-frequency spectrogram with a set of points in a finite plane is provided. It is shown that a finite affine plane is a powerful generator of frequency-hopping codes for multiple-access channels, and that it provides optimum performance codes in a noiseless environment.
Jevtic, Dusan B.↗
Single-Shot Decoding of Good Quantum LDPC Codes
Abstract Quantum Tanner codes constitute a family of quantum low-density parity-check codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate single-shot quantum error correction (QEC) of adversarial noise, where one measurement round (consisting of constant-weight parity checks) suffices to perform reliable QEC even in the presence of measurement errors. We establish this result for both the sequential and parallel decoding algorithms introduced by Leverrier and Zémor. Furthermore, we show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round. Combined with good code parameters, the resulting constant-time overhead of QEC and robustness to (possibly time-correlated) adversarial noise make quantum Tanner codes alluring from the perspective of quantum fault-tolerant protocols.
97 MATHEMATICS AND COMPUTING↗
Development and Implementation of Dynamic Scripts to Execute Cycled WRF/GSI Forecasts
Automating the coupling of data assimilation (DA) and modeling systems is a unique challenge in the numerical weather prediction (NWP) research community. In recent years, the Development Testbed Center (DTC) has released well-documented tools such as the Weather Research and Forecasting (WRF) model and the Gridpoint Statistical Interpolation (GSI) DA system that can be easily downloaded, installed, and run by researchers on their local systems. However, developing a coupled system in which the various preprocessing, DA, model, and postprocessing capabilities are all integrated can be labor-intensive if one has little experience with any of these individual systems. Additionally, operational modeling entities generally have specific coupling methodologies that can take time to understand and develop code to implement properly. To better enable collaborating researchers to perform modeling and DA experiments with GSI, the Short-term Prediction Research and Transition (SPoRT) Center has developed a set of Perl scripts that couple GSI and WRF in a cycling methodology consistent with the use of real-time, regional observation data from the National Centers for Environmental Prediction (NCEP)/Environmental Modeling Center (EMC). Because Perl is open source, the code can be easily downloaded and executed regardless of the user's native shell environment. This paper will provide a description of this open-source code and descriptions of a number of the use cases that have been performed by SPoRT collaborators using the scripts on different computing systems.
Zavodsky, Bradley↗