Search NASA⌕ Search

SEARCH · Search NASA

Results for “code generation”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

Finite element method - A companion in experimental mechanics

The hybrid experimental-numerical procedure for structural analysis is described by its applications in fracture mechanics. The procedure was first verified by the excellent agreements between the dynamic stress intensity factors obtained directly by dynamic photoelasticity and those generated by the hybrid procedure where a dynamic finite element code was executed in its generation mode. The hybrid procedure was then used to determine the dynamic fracture toughness of reaction bonded silicon nitride.

Kobayashi, A. S.↗
NASA NTRS2000

Mean Line Pump Flow Model in Rocket Engine System Simulation

A mean line pump flow modeling method has been developed to provide a fast capability for modeling turbopumps of rocket engines. Based on this method, a mean line pump flow code PUMPA has been written that can predict the performance of pumps at off-design operating conditions, given the loss of the diffusion system at the design point. The pump code can model axial flow inducers, mixed-flow and centrifugal pumps. The code can model multistage pumps in series. The code features rapid input setup and computer run time, and is an effective analysis and conceptual design tool. The map generation capability of the code provides the map information needed for interfacing with a rocket engine system modeling code. The off-design and multistage modeling capabilities of the code permit parametric design space exploration of candidate pump configurations and provide pump performance data for engine system evaluation. The PUMPA code has been integrated with the Numerical Propulsion System Simulation (NPSS) code and an expander rocket engine system has been simulated. The mean line pump flow code runs as an integral part of the NPSS rocket engine system simulation and provides key pump performance information directly to the system model at all operating conditions.

Veres, Joseph P.↗
NASA NTRS1993

Optimum Design of Aerospace Structural Components Using Neural Networks

The application of artificial neural networks to capture structural design expertise is demonstrated. The principal advantage of a trained neural network is that it requires a trivial computational effort to produce an acceptable new design. For the class of problems addressed, the development of a conventional expert system would be extremely difficult. In the present effort, a structural optimization code with multiple nonlinear programming algorithms and an artificial neural network code NETS were used. A set of optimum designs for a ring and two aircraft wings for static and dynamic constraints were generated using the optimization codes. The optimum design data were processed to obtain input and output pairs, which were used to develop a trained artificial neural network using the code NETS. Optimum designs for new design conditions were predicted using the trained network. Neural net prediction of optimum designs was found to be satisfactory for the majority of the output design parameters. However, results from the present study indicate that caution must be exercised to ensure that all design variables are within selected error bounds.

Berke, L.↗
NASA NTRS1993

Aerodynamic analysis of hypersonic waverider aircraft

The purpose of this study is to validate two existing codes used by the Systems Analysis Branch at NASA ARC, and to modify the codes so they can be used to generate and analyze waverider aircraft at on-design and off-design conditions. To generate waverider configurations and perform the on-design analysis, the appropriately named Waverider code is used. The Waverider code is based on the Taylor-Maccoll equations. Validation is accomplished via a comparison with previously published results. The Waverider code is modified to incorporate a fairing to close off the base area of the waverider configuration. This creates a more realistic waverider. The Hypersonic Aircraft Vehicle Optimization Code (HAVOC) is used to perform the off-design analysis of waverider configurations generated by the Waverider code. Various approximate analysis methods are used by HAVOC to predict the aerodynamic characteristics, which are validated via a comparison with experimental results from a hypersonic test model.

Sandlin, Doral R.↗
NASA NTRS2010

Support for Systematic Code Reviews with the SCRUB Tool

SCRUB is a code review tool that supports both large, team-based software development efforts (e.g., for mission software) as well as individual tasks. The tool was developed at JPL to support a new, streamlined code review process that combines human-generated review reports with program-generated review reports from a customizable range of state-of-the-art source code analyzers. The leading commercial tools include Codesonar, Coverity, and Klocwork, each of which can achieve a reasonably low rate of false-positives in the warnings that they generate. The time required to analyze code with these tools can vary greatly. In each case, however, the tools produce results that would be difficult to realize with human code inspections alone. There is little overlap in the results produced by the different analyzers, and each analyzer used generally increases the effectiveness of the overall effort. The SCRUB tool allows all reports to be accessed through a single, uniform interface (see figure) that facilitates brows ing code and reports. Improvements over existing software include significant simplification, and leveraging of a range of commercial, static source code analyzers in a single, uniform framework. The tool runs as a small stand-alone application, avoiding the security problems related to tools based on Web browsers. A developer or reviewer, for instance, must have already obtained access rights to a code base before that code can be browsed and reviewed with the SCRUB tool. The tool cannot open any files or folders to which the user does not already have access. This means that the tool does not need to enforce or administer any additional security policies. The analysis results presented through the SCRUB tool s user interface are always computed off-line, given that, especially for larger projects, this computation can take longer than appropriate for interactive tool use. The recommended code review process that is supported by the SCRUB tool consists of three phases: Code Review, Developer Response, and Closeout Resolution. In the Code Review phase, all tool-based analysis reports are generated, and specific comments from expert code reviewers are entered into the SCRUB tool. In the second phase, Developer Response, the developer is asked to respond to each comment and tool-report that was produced, either agreeing or disagreeing to provide a fix that addresses the issue that was raised. In the third phase, Closeout Resolution, all disagreements are discussed in a meeting of all parties involved, and a resolution is made for all disagreements. The first two phases generally take one week each, and the third phase is concluded in a single closeout meeting.

Holzmann, Gerald J.↗
NASA NTRS2006

Simulink-Based Simulation Architecture for Evaluating Controls for Aerospace Vehicles (SAREC-ASV)

The Simulation Architecture for Evaluating Controls for Aerospace Vehicles (SAREC-ASV) is a Simulink-based approach to providing an engineering quality desktop simulation capability for finding trim solutions, extracting linear models for vehicle analysis and control law development, and generating open-loop and closed-loop time history responses for control system evaluation. It represents a useful level of maturity rather than a finished product. The layout is hierarchical and supports concurrent component development and validation, with support from the Concurrent Versions System (CVS) software management tool. Real Time Workshop (RTW) is used to generate pre-compiled code for substantial component modules, and templates permit switching seamlessly between original Simulink and code compiled for various platforms. Two previous limitations are addressed. Turn around time for incorporating tabular model components was improved through auto-generation of required Simulink diagrams based on data received in XML format. The layout was modified to exploit a Simulink "compile once, evaluate multiple times" capability for zero elapsed time for use in trimming and linearizing. Trim is achieved through a Graphical User Interface (GUI) with a narrow, script definable interface to the vehicle model which facilitates incorporating new models.

Christhilf, David m.↗
NASA NTRS1989

Computing viscous reactive flow over blunt winged vehicles

A hypersonic flow simulation methodology is developed for analyzing thermochemical nonequilibrium and viscous phenomena associated with space-flight vehicles at realistic conditions. The computer code consists of grid generation, Navier-Stokes and species models, and equation solvers for a complete configuration at arbitrary angles of attack. Provisions are implemented in the code to consider chemically frozen or equilibrium chemistry, inviscid model, conic configurations and simplifications of physical parameters for verifying solution consistency and accuracy. Implications of physical modeling and input parameters on a blunt-cone flow are investigated in details. Applications to USA Orbiter-like vehicles have emphasized the leeside canopy flow as well as the bow-wing shock interaction problem at Mach 22 and 40 deg angle of attack. Comparison of windward centerline pressures and heating rates with available wind-tunnel and flight data is in progress.

Li, C. P.↗
NASA NTRS1993

Experimental Determination of in Situ Utilization of Lunar Regolith for Thermal Energy Storage

A Lunar Thermal Energy from Regolith (LUTHER) experiment has been designed and fabricated at the NASA Lewis Research Center to determine the feasibility of using lunar soil as thermal energy storage media. The experimental apparatus includes an alumina ceramic canister (25.4 cm diameter by 45.7 cm length) which contains simulated lunar regolith, a heater (either radiative or conductive), 9 heat shields, a heat transfer cold jacket, and 19 type B platinum rhodium thermocouples. The simulated lunar regolith is a basalt, mined and processed by the University of Minnesota, that closely resembles the lunar basalt returned to earth by the Apollo missions. The experiment will test the effects of vacuum, particle size, and density on the thermophysical properties of the regolith. The properties include melt temperature (range), specific heat, thermal conductivity, and latent heat of storage. Two separate tests, using two different heaters, will be performed to study the effect of heating the system using radiative and conductive heat transfer. The physical characteristics of the melt pattern, material compatibility of the molten regolith, and the volatile gas emission will be investigated by heating a portion of the lunar regolith to its melting temperature (1435 K) in a 10(exp -4) pascal vacuum chamber, equipped with a gas spectrum analyzer. A finite differencing SINDA model was developed at NASA Lewis Research Center to predict the performance of the LUTHER experiment. The analytical results of the code will be compared with the experimental data generated by the LUTHER experiment. The code will predict the effects of vacuum, particle size, and density has on the heat transfer to the simulated regolith.

Richter, Scott W.↗
NASA NTRS2012

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all having the linear minimum distance property, and structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds, and families of such codes of different rates can be decoded efficiently using a common decoding architecture.

Divsalar, Dariush↗
NASA NTRS2012

Rate-compatible protograph LDPC code families with linear minimum distance

Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.

Divsalar, Dariush↗
NASA NTRS1988

Using a simulation assistant in modeling manufacturing systems

Numerous simulation languages exist for modeling discrete event processes, and are now ported to microcomputers. Graphic and animation capabilities were added to many of these languages to assist the users build models and evaluate the simulation results. With all these languages and added features, the user is still plagued with learning the simulation language. Futhermore, the time to construct and then to validate the simulation model is always greater than originally anticipated. One approach to minimize the time requirement is to use pre-defined macros that describe various common processes or operations in a system. The development of a simulation assistant for modeling discrete event manufacturing processes is presented. A simulation assistant is defined as an interactive intelligent software tool that assists the modeler in writing a simulation program by translating the modeler's symbolic description of the problem and then automatically generating the corresponding simulation code. The simulation assistant is discussed with emphasis on an overview of the simulation assistant, the elements of the assistant, and the five manufacturing simulation generators. A typical manufacturing system will be modeled using the simulation assistant and the advantages and disadvantages discussed.

Schroer, Bernard J.↗
NASA NTRS1994

Error control techniques for satellite and space communications

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

Costello, Daniel J., Jr.↗
NASA NTRS2015

Implicit Large-Eddy Simulations of Zero-Pressure Gradient, Turbulent Boundary Layer

A set of direct simulations of zero-pressure gradient, turbulent boundary layer flows are conducted using various span widths (62-630 wall units), to document their influence on the generated turbulence. The FDL3DI code that solves compressible Navier-Stokes equations using high-order compact-difference scheme and filter, with the standard recycling/rescaling method of turbulence generation, is used. Results are analyzed at two different Re values (500 and 1,400), and compared with spectral DNS data. They show that a minimum span width is required for the mere initiation of numerical turbulence. Narrower domains ((is) less than 100 w.u.) result in relaminarization. Wider spans ((is) greater than 600 w.u.) are required for the turbulent statistics to match reference DNS. The upper-wall boundary condition for this setup spawns marginal deviations in the mean velocity and Reynolds stress profiles, particularly in the buffer region.

Turblent boundary layer↗
NASA NTRS1995

The trellis complexity of convolutional codes

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.

Mceliece, R. J.↗
NASA NTRS1993

BLASIM - A computational tool to assess ice impact damage on engine blades

A portable computer code called BLASIM is developed at NASA LeRC to assess the ice impact damage on aircraft engine blades. In addition to the ice impact analyses, the code is also capable of carrying out static, dynamic, resonance margin and flutter analyses. The blade can be solid, hollow, superhybrid or composite material. An optional preprocessor (input generator) is also developed to generate input to the code through interactive process. The blade geometry can be defined either by a series of airfoils at discrete input stations or by a finite element grid. The code employs a coarse fixed finite element mesh with triangular plate finite elements and has quick turnaround time. The ice piece is modeled as an equivalent spherical object and has the velocity opposite to that of the aircraft with direction parallel to the engine axis. For the local impact damage assessment, the impact force is considered as a distributed load acting over a region around the impact point and the average radial strain of the finite elements along the leading edge is taken as a measure of the local damage. To estimate the damage at the blade root, the impact is considered to be an impulse and a combined stress failure criteria is employed. Parametric studies for local and root ice impact damage, and post-impact dynamics are discussed for solid and composite blades.

Reddy, E. S.↗
NASA NTRS1993

Automatic array alignment in data-parallel programs

FORTRAN 90 and other data-parallel languages express parallelism in the form of operations on data aggregates such as arrays. Misalignment of the operands of an array operation can reduce program performance on a distributed-memory parallel machine by requiring nonlocal data accesses. Determining array alignments that reduce communication is therefore a key issue in compiling such languages. We present a framework for the automatic determination of array alignments in array-based, data-parallel languages. Our language model handles array sectioning, reductions, spreads, transpositions, and masked operations. We decompose alignment functions into three constituents: axis, stride, and offset. For each of these subproblems, we show how to solve the alignment problem for a basic block of code, possibly containing common subexpressions. Alignments are generated for all array objects in the code, both named program variables and intermediate results. We assign computation to processors by virtue of explicit alignment of all temporaries; the resulting work assignment is in general better than that provided by the 'owner-computes' rule. Finally, we present some ideas for dealing with control flow, replication, and dynamic alignments that depend on loop induction variables.

Chatterjee, Siddhartha↗
NASA NTRS2011

Dynamic Loads Generation for Multi-Point Vibration Excitation Problems

A random-force method has been developed to predict dynamic loads produced by rocket-engine random vibrations for new rocket-engine designs. The method develops random forces at multiple excitation points based on random vibration environments scaled from accelerometer data obtained during hot-fire tests of existing rocket engines. This random-force method applies random forces to the model and creates expected dynamic response in a manner that simulates the way the operating engine applies self-generated random vibration forces (random pressure acting on an area) with the resulting responses that we measure with accelerometers. This innovation includes the methodology (implementation sequence), the computer code, two methods to generate the random-force vibration spectra, and two methods to reduce some of the inherent conservatism in the dynamic loads. This methodology would be implemented to generate the random-force spectra at excitation nodes without requiring the use of artificial boundary conditions in a finite element model. More accurate random dynamic loads than those predicted by current industry methods can then be generated using the random force spectra. The scaling method used to develop the initial power spectral density (PSD) environments for deriving the random forces for the rocket engine case is based on the Barrett Criteria developed at Marshall Space Flight Center in 1963. This invention approach can be applied in the aerospace, automotive, and other industries to obtain reliable dynamic loads and responses from a finite element model for any structure subject to multipoint random vibration excitations.

Shen, Lawrence↗
NASA NTRS1979

Analytical predictions of RTG power degradation

The DEGRA computer code that is based on a mathematical model which predicts performance and time-temperature dependent degradation of a radioisotope thermoelectric generator is discussed. The computer code has been used to predict performance and generator degradation for the selenide Ground Demonstration Unit (GDS-1) and the generator used in the Galileo Project. Results of parametric studies of load voltage vs generator output are examined as well as the I-V curve and the resulting predicted power vs voltage. The paper also discusses the increased capability features contained in DEGRA2 and future plans for expanding the computer code performance.

Noon, E. L.↗