SEARCH · Engineering Papers

Results for “compute in memory”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Conservative zonal schemes for patched grids in 2 and 3 dimensions

The computation of flow over complex geometries, such as realistic aircraft configurations, poses difficult grid generation problems for computational aerodynamicists. The creation of a traditional, single-module grid of acceptable quality about an entire configuration may be impossible even with the most sophisticated of grid generation techniques. A zonal approach, wherein the flow field is partitioned into several regions within which grids are independently generated, is a practical alternative for treating complicated geometries. This technique not only alleviates the problems of discretizing a complex region, but also facilitates a block processing approach to computation thereby circumventing computer memory limitations. The use of such a zonal scheme, however, requires the development of an interfacing procedure that ensures a stable, accurate, and conservative calculation for the transfer of information across the zonal borders.

Hessenius, Kristin A.↗

NASA NTRS1987

The use of the QR factorization in the partial realization problem

The use of the QR factorization of the Hankel matrix in solving the partial realization problem is analyzed. Straightforward use of the QR factorization results in a realization scheme that possesses all of the computational advantages of Rissanen's realization scheme. These latter properties are computational efficiency, recursiveness, use of limited computer memory, and the realization of a system triplet having a condensed structure. Moreover, this scheme is robust when the order of the system corresponds to the rank of the Hankel matrix. When this latter condition is violated, an approximate realization could be determined via the QR factorization. In this second scheme, the given Hankel matrix is approximated by a low-rank non-Hankel matrix. Furthermore, it is demonstrated that column pivoting might be incorporated in this second scheme. The results presented are derived for a single input/single output system, but this does not seem to be a restriction.

Verhaegen, M. H.↗

NASA NTRS1988

Programmable Synaptic Arrays For Electronic Neural Networks

High resistances prevent hotspots in parallel input and output operation. Nonvolatile computer memory combines ultrahigh storage density with extremely-low power dissipation. Accommodates about 1 billion bits in square centimeter of surface area. Bit written with expenditure of less than 1 nanojoule of energy and read with even lower energy. Developed for parallel input and output operation.

Thakoor, Anilkumar P.↗

NASA NTRS1989

Gray-Scale Processing For Tracking Of Welds

Digital analysis of video-image-processing system contributes to automation of weld-seam tracking. Makes no contact with seam. Small television camera views seam just ahead of point currently being welded. Arc provides illumination. Periodically frame grabber digitizes video image and stores in computer memory as gray-scale values. Seam located by analyzing Hough-transform arrays of derivatives of digitally-filtered image data. Information on location and orientation of seam used as feedback by welding robot to correct deviations of electrode from seam as welding continues.

Gutow, David A.↗

NASA NTRS1989

Effects of space radiation on electronic microcircuits

The single event effects or phenomena (SEP), which so far have been observed as events falling on one or another of the SE classes: Single Event Upset (SEU), Single Event Latchup (SEL) and Single Event Burnout (SEB), are examined. Single event upset is defined as a lasting, reversible change in the state of a multistable (usually bistable) electronic circuit such as a flip-flop or latch. In a computer memory, SEUs manifest themselves as unexplained bit flips. Since latchup is in general caused by a single event of short duration, the single event part of the SEL term is superfluous. Nevertheless, it is used customarily to differentiate latchup due to a single heavy charged particle striking a sensitive cell from more ordinary kinds of latchup. Single event burnout (SEB) refers usually to total instantaneous failure of a power FET when struck by a single particle, with the device shorting out the power supply. An unforeseen failure of these kinds can be catastrophic to a space mission, and the possibilities are discussed.

Kolasinski, W. A.↗

NASA NTRS1990

Dynamic substructuring by the boundary flexibility vector method of component mode synthesis

Component mode synthesis (CMS) is a method of dynamic analysis, for structures having a large number of degrees of freedom (DOF). These structures often required lengthy computer CPU time and large computer memory resources, if solved directly by the finite-element method (FEM). In CMS, the structure is divided into independent components in which the DOF are defined by a set of generalized coordinates defined by displacement shapes. The number of the generalized coordinates are much less than the original number of physical DOF, in the component. The displacement shapes are used to transform the component property matrices and any applied external loads, to a reduced system of coordinates. Reduced system property matrices are assembled, and any type of dynamic analysis is carried out in the reduced coordinate system. Any obtained results are back transformed to the original component coordinate systems. In all conventional methods of CMS, the mode shapes used for components are dynamic mode shapes, supplemented by static deflected shapes. Historically, all the dynamic mode shapes used in conventional CMS are the natural modes (eigenvectors) of components. A new method of CMS, namely the boundary flexibility vector method of CMS, is presented. The method provides for the incorporation of a set of static Ritz vectors, referred to as boundary flexibility vectors, as a replacement and/or supplement to conventional eigenvectors, as displacement shapes for components. The generation of these vectors does not require the solution of a costly eigenvalue problem, as in the case of natural modes in conventional CMS, and hence a substantial saving in CPU time can be achieved. The boundary flexibility vectors are generated from flexibility (or stiffness) properties of components. The formulation presented is for both free and fixed-interface components, and for both the free and forced vibration problems. Free and forced vibration numerical examples are presented to verify the accuracy of the method and the saving in CPU time. Compared to conventional methods of CMS, the results indicate that by using the new method, more accurate results can be obtained with a substantial saving in CPU time.

Abdallah, Ayman Ahmed↗

NASA NTRS1989

A comparison of select image-compression algorithms for an electronic still camera

This effort is a study of image-compression algorithms for an electronic still camera. An electronic still camera can record and transmit high-quality images without the use of film, because images are stored digitally in computer memory. However, high-resolution images contain an enormous amount of information, and will strain the camera's data-storage system. Image compression will allow more images to be stored in the camera's memory. For the electronic still camera, a compression algorithm that produces a reconstructed image of high fidelity is most important. Efficiency of the algorithm is the second priority. High fidelity and efficiency are more important than a high compression ratio. Several algorithms were chosen for this study and judged on fidelity, efficiency and compression ratio. The transform method appears to be the best choice. At present, the method is compressing images to a ratio of 5.3:1 and producing high-fidelity reconstructed images.

Nerheim, Rosalee↗

NASA NTRS1990

Execution time supports for adaptive scientific algorithms on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

NASA NTRS1990

Implicit and explicit computations of flows past cavities with and without yaw

Implicit and explicit computations are presented to study the supersonic, turbulent flows past three-dimensional, rectangular cavities at 0 and 45 deg yaw angle. The Reynolds-averaged, unsteady, compressible, complete Navier-Stokes equations are solved time-accurately, including the Reynolds stresses. The number of major vortices inside and the separation characteristics on the cavity floor are different for cavities with length-to-depth ratios of 3.0 and 6.7. Due to the oscillations of the shear layer, which randomly exposes the cavity flow to the external flow, vortices are shed into the mainstream. When the upstream flow approaches a cavity at yaw, the width-to-depth ratio also becomes an important parameter. The dominant rotational planes of the major vortices incline at an angle to the vertical plane due to yaw. The execution of the implicit scheme is about three times faster, but it requires about four times more computer memory.

Baysal, Oktay↗

NASA NTRS1991

Applications of the conjugate gradient FFT method in scattering and radiation including simulations with impedance boundary conditions

The theoretical and computational aspects related to the application of the Conjugate Gradient FFT (CGFFT) method in computational electromagnetics are examined. The advantages of applying the CGFFT method to a class of large scale scattering and radiation problems are outlined. The main advantages of the method stem from its iterative nature which eliminates a need to form the system matrix (thus reducing the computer memory allocation requirements) and guarantees convergence to the true solution in a finite number of steps. Results are presented for various radiators and scatterers including thin cylindrical dipole antennas, thin conductive and resistive strips and plates, as well as dielectric cylinders. Solutions of integral equations derived on the basis of generalized impedance boundary conditions (GIBC) are also examined. The boundary conditions can be used to replace the profile of a material coating by an impedance sheet or insert, thus, eliminating the need to introduce unknown polarization currents within the volume of the layer. A general full wave analysis of 2-D and 3-D rectangular grooves and cavities is presented which will also serve as a reference for future work.

Barkeshli, Kasra↗

NASA NTRS1990

Neptune encounter - Guidance and control's finest hour

The Voyager 2 technology had to be stretched significantly to confront the challenges posed by the environment of Neptune. Little was known about Neptune's characteristics because of its great distance from the sun; and its reduced light levels required longer exposure time. Thus, it was necessary to reduce the spacecraft limit cycle; this was made more difficult by the trajectory selected, which caused high spacecraft-to-target rates (these rates dictated the use of image motion compensation). Another challenge faced by Voyager 2 was the need to perform all the required image motion compensation with a limited quantity of attitude control computer and command computer memory, together with a limited quantity of tape recorder resources. This made necessary a new concept of real-time image motion compensation.

Miller, Maurine↗

NASA NTRS1990

Execution time support for scientific programs on distributed memory machines

Berryman, Harry↗

NASA NTRS1990

Galileo spacecraft power management and distribution system

The Galileo PMAD (power management and distribution system) is described, and the design drivers that established the final as-built hardware are discussed. The spacecraft is powered by two general-purpose heat-source-radioisotope thermoelectric generators. Power bus regulation is provided by a shunt regulator. Galileo PMAD distributes a 570-W beginning of mission (BOM) power source to a user complement of some 137 load elements. Extensive use of pyrotechnics requires two pyro switching subassemblies. They initiate 148 squibs which operate the 47 pyro devices on the spacecraft. Detection and correction of faults in the Galileo PMAD is an autonomous feature dictated by requirements for long life and reliability in the absence of ground-based support. Volatile computer memories in the spacecraft command and data system and attitude control system require a continuous source of backup power during all anticipated power bus fault scenarios. Power for the Jupiter Probe is conditioned, isolated, and controlled by a Probe interface subassembly. Flight performance of the spacecraft and the PMAD has been successful to date, with no major anomalies.

Detwiler, R. C.↗

NASA NTRS1990

Primary lithium cell life studies

One solution for providing a truly independent power source is to package, within the critical subsystem element, a primary battery that can remain dormant for time periods as long as the mission life, which can be 10-15 years, maximum. When primary power from the spacecraft solar array/battery system is interrupted, the backup battery system, which is connected through a diode to the power input line, would automatically support the load to avoid a power interruption to the critical load for a time period long enough to ensure that ground control could access the satellite and correct the anomaly by sending appropriate commands to the spacecraft. Critical subsystems identified for the application are telemetry and command circuits, volatile computer memory, attitude control circuits, and some critical payloads. Due to volume packaging and weight restrictions that exist on most spacecraft, coupled with the long storage periods required, lithium cell technology was selected for the backup power source. Because of the high energy density (200-400 Wh/kg), long shelf life, and load capability, soluble cathode primary lithium technology was chosen. The most important lithium cell properties that require detail characterization for this application are capacity loss, shelf life, and the voltage delay mechanism. These are functions of storage time and temperature. During storage, a passive film builds up on the lithium electrode. The film protects the lithium electrode from progressive capacity decay but requires time to break down when a load is applied. This phenomenon results in a depressed voltage during the period of film breakdown which can last from fractions of a second to minutes.

Capulli, John↗

NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel communication rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

NASA NTRS1991

The study of PDF turbulence models in combustion

In combustion computations, it is known that the predictions of chemical reaction rates are poor if conventional turbulence models are used. The probability density function (pdf) method seems to be the only alternative that uses local instantaneous values of the temperature, density, etc., in predicting chemical reaction rates, and thus is the only viable approach for more accurate turbulent combustion calculations. The fact that the pdf equation has a very large dimensionality renders finite difference schemes extremely demanding on computer memories and thus impractical. A logical alternative is the Monte Carlo scheme. Since CFD has a certain maturity as well as acceptance, it seems that the use of a combined CFD and Monte Carlo scheme is more beneficial. Therefore, a scheme is chosen that uses a conventional CFD flow solver in calculating the flow field properties such as velocity, pressure, etc., while the chemical reaction part is solved using a Monte Carlo scheme. The discharge of a heated turbulent plane jet into quiescent air was studied. Experimental data for this problem shows that when the temperature difference between the jet and the surrounding air is small, buoyancy effect can be neglected and the temperature can be treated as a passive scalar. The fact that jet flows have a self-similar solution lends convenience in the modeling study. Futhermore, the existence of experimental data for turbulent shear stress and temperature variance make the case ideal for the testing of pdf models wherein these values can be directly evaluated.

Hsu, Andrew T.↗

NASA NTRS1992

An incremental strategy for calculating consistent discrete CFD sensitivity derivatives

In this preliminary study involving advanced computational fluid dynamic (CFD) codes, an incremental formulation, also known as the 'delta' or 'correction' form, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods appear to be needed for future 3D applications; however, because direct solver methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form result in certain difficulties, such as ill-conditioning of the coefficient matrix, which can be overcome when these equations are cast in the incremental form; these and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two laminar sample problems: (1) transonic flow through a double-throat nozzle; and (2) flow over an isolated airfoil.

Korivi, Vamshi Mohan↗

NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗