Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression algorithm”

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 757 records · Page 42

Viscous simulation method for unsteady flows past multicomponent configurations

The present algorithm for the numerical simulation of flows about complex configurations (whose multiple and nonsimilar components have arbitraty geometries) employs a hybridization of the domain decomposition techniques for grid generation as well as to reduce computer-memory requirements. A fully vectorized, finite-volume, upwind-biased, approximately factored multigrid method is used to solve 3D Reynolds-averaged unsteady and compressible Navier-Stokes equations simulating supersonic flows past an ogive-nose-cylinder near or within a cavity. The time-averaged surface pressures obtained compare favorably with the wind tunnel data.

Fouladi, Kamran↗

Interactive Terascale Particle Visualization

This paper describes the methods used to produce an interactive visualization of a 2 TB computational fluid dynamics (CFD) data set using particle tracing (streaklines). We use the method introduced by Bruckschen et al. [2001] that pre-computes a large number of particles, stores them on disk using a space-filling curve ordering that minimizes seeks, and then retrieves and displays the particles according to the user's command. We describe how the particle computation can be performed using a PC cluster, how the algorithm can be adapted to work with a multi-block curvilinear mesh, and how the out-of-core visualization can be scaled to 296 billion particles while still achieving interactive performance on PG hardware. Compared to the earlier work, our data set size and total number of particles are an order of magnitude larger. We also describe a new compression technique that allows the lossless compression of the particles by 41% and speeds the particle retrieval by about 30%.

Ellsworth, David↗

Concepts for on board satellite image registration. Volume 4: Impact of data set selection on satellite on board signal processing

The NASA NEEDS program goals present a requirement for on-board signal processing to achieve user-compatible, information-adaptive data acquisition. This volume addresses the impact of data set selection on data formatting required for efficient telemetering of the acquired satellite sensor data. More specifically, the FILE algorithm developed by Martin-Marietta provides a means for the determination of those pixels from the data stream effects an improvement in the achievable system throughput. It will be seen that based on the lack of statistical stationarity in cloud cover, spatial distribution periods exist where data acquisition rates exceed the throughput capability. The study therefore addresses various approaches to data compression and truncation as applicable to this sensor mission.

Ruedger, W. H.↗

A solution procedure for behavior of thick plates on a nonlinear foundation and postbuckling behavior of long plates

Approximate solutions for three nonlinear orthotropic plate problems are presented: (1) a thick plate attached to a pad having nonlinear material properties which, in turn, is attached to a substructure which is then deformed; (2) a long plate loaded in inplane longitudinal compression beyond its buckling load; and (3) a long plate loaded in inplane shear beyond its buckling load. For all three problems, the two dimensional plate equations are reduced to one dimensional equations in the y-direction by using a one dimensional trigonometric approximation in the x-direction. Each problem uses different trigonometric terms. Solutions are obtained using an existing algorithm for simultaneous, first order, nonlinear, ordinary differential equations subject to two point boundary conditions. Ordinary differential equations are derived to determine the variable coefficients of the trigonometric terms.

Stein, M.↗

A locally implicit method for fluid flow problems

The fluid flow inside the space shuttle main engine (SSME) traverses through a complex geometrical configuration. The flow is compressible, viscous, and turbulent with pockets of separated regions. Several computer codes are being developed to solve three dimensional Navier-Stokes equations with different turbulence models for analyzing the SSME internal flow. The locally implicit scheme is a computationally efficient scheme which converges rapidly in multi-grid modes for elliptic problems. It has the promise of providing a rapidly converging algorithm for steady-state viscous flow problems.

Reddy, K. C.↗

An explicit Runge-Kutta method for turbulent reacting flow calculations

The paper presents a numerical method for the solution of the conservation equations governing steady, reacting, turbulent viscous flow in two-dimensional geometries, in both Cartesian and axisymmetric coordinates. These equations are written in Favre-averaged form and closed with a first order model. A two-equation K-epsilon model, where low Reynolds number and compressibility effects are included, and a modified eddy-break up model are used to simulate fluid mechanics turbulence, chemistry and turbulence-combustion interaction. The solution is obtained by using a pseudo-unsteady method with improved perturbation propagation properties. The equations are discretized in space by using a finite volume formulation. An explicit multi-stage dissipative Runge-Kutta algorithm is then used to advance the flow equations in the pseudo-time. The method is applied to the computation of both diffusion and premixed turbulent reacting flows. The computed temperature distributions compare favorably with experimental data.

Boretti, A. A.↗

Pipeline synthetic aperture radar data compression utilizing systolic binary tree-searched architecture for vector quantization

A system for data compression utilizing systolic array architecture for Vector Quantization (VQ) is disclosed for both full-searched and tree-searched. For a tree-searched VQ, the special case of a Binary Tree-Search VQ (BTSVQ) is disclosed with identical Processing Elements (PE) in the array for both a Raw-Codebook VQ (RCVQ) and a Difference-Codebook VQ (DCVQ) algorithm. A fault tolerant system is disclosed which allows a PE that has developed a fault to be bypassed in the array and replaced by a spare at the end of the array, with codebook memory assignment shifted one PE past the faulty PE of the array.

Chang, Chi-Yung↗

A data compression technique for synthetic aperture radar images

A data compression technique is developed for synthetic aperture radar (SAR) imagery. The technique is based on an SAR image model and is designed to preserve the local statistics in the image by an adaptive variable rate modification of block truncation coding (BTC). A data rate of approximately 1.6 bit/pixel is achieved with the technique while maintaining the image quality and cultural (pointlike) targets. The algorithm requires no large data storage and is computationally simple.

Frost, V. S.↗

Parabolized Navier-Stokes algorithm for chemically reacting flows

A second-order parabolized Navier-Stokes algorithm based on the MacCormack (1969) explicit scheme is used to study three-dimensional chemically reacting flows with finite-rate chemistry. The method can treat the chemical source term implicitly, and it accounts for the multicomponent diffusion and convection of the chemical species. The method is demonstrated with the nonreacting case of a Mach-3 flow over a double-wedge compression corner and the case of streamwise hydrogen injection at sonic velocity in a Mach-2.44 vitiated air stream.

Kamath, H.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗

Planning and executing motions for multibody systems in free-fall

The purpose of this research is to develop an end-to-end system that can be applied to a multibody system in free-fall to analyze its possible motions, save those motions in a database, and design a controller that can execute those motions. A goal is for the process to be highly automated and involve little human intervention. Ideally, the output of the system would be data and algorithms that could be put in ROM to control the multibody system in free-fall. The research applies to more than just robots in space. It applies to any multibody system in free-fall. Mathematical techniques from nonlinear control theory were used to study the nature of the system dynamics and its possible motions. Optimization techniques were applied to plan motions. Image compression techniques were proposed to compress the precomputed motion data for storage. A linearized controller was derived to control the system while it executes preplanned trajectories.

Cameron, Jonathan M.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step.

Sankar, Lakshmi N.↗

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗

Long decoding runs for Galileo's convolutional codes

Decoding results are described for long decoding runs of Galileo's convolutional codes. A 1 k-bit/sec hardware Viterbi decoder is used for the (15, 1/4) convolutional code, and a software Viterbi decoder is used for the (7, 1/2) convolutional code. The output data of these long runs are stored in data files using a data compression format which can reduce file size by a factor of 100 to 1 typically. These data files can be used to replicate the long, time-consuming runs exactly and are useful to anyone who wants to analyze the burst statistics of the Viterbi decoders. The 1 k-bit/sec hardware Viterbi decoder was developed in order to demonstrate the correctness of certain algorithmic concepts for decoding Galileo's experimental (15, 1/4) code, and for the long-constraint-length codes in general. The hardware decoder can be used both to search for good codes and to measure accurately the performance of known codes.

Lahmeyer, C. R.↗

Techniques in processing multi-frequency multi-polarization spaceborne SAR data

This paper presents the algorithm design of the SIR-C ground data processor, with emphasis on the unique elements involved in the production of registered multifrequency polarimetric data products. A quick-look processing algorithm used for generation of low-resolution browse image products and estimation of echo signal parameters is also presented. Specifically the discussion covers: (1) azimuth reference function generation to produce registered polarimetric imagery; (2) geometric rectification to accommondate cross-track and along-track Doppler drifts; (3) multilook filtering designed to generate output imagery with a uniform resolution; and (4) efficient coding to compress the polarimetric image data for distribution.

Curlander, John C.↗

Vortex tubes in turbulent flows: Identification, representation, reconstruction

In many cases the structure of a fluid flow is well-characterized by its vortices, especially for the purpose of visualization. In this paper we present a new algorithm for identifying vortices in complex flows. The algorithm produces a skeleton line along the center of a vortex by using a two-step predictor-corrector scheme. The vorticity vector field serves as the predictor and the pressure gradient (in the perpendicular plane) serves as the corrector. We describe an economical description of the vortex tube's cross-section: a 5-term truncated Fourier series is generally sufficient, and it compresses the representation of the flow by a factor of 4000 or more. We reconstruct the vortex tubes as generalized cylinders, providing a polygonal mesh suitable for display on a graphics workstation. We show how the reconstructed geometry of vortex tubes can be enhanced to help visualize helical motion in a static image.

Banks, David C.↗

Detection of the Impact of Ice Crystal Accretion in an Aircraft Engine Compression System During Dynamic Operation

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation community. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. Here a detection algorithm is developed which has the capability to detect the impact of ice accretion in the Low Pressure Compressor of an aircraft engine during steady flight as well as during changes in altitude. Unfortunately, the algorithm as implemented was not able to distinguish throttle changes from ice accretion and thus more work remains to be done.

high ice water content↗

Detection of the Impact of Ice Crystal Accretion in an Aircraft Engine Compression System During Dynamic Operation

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation community. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. Here a detection algorithm is developed which has the capability to detect the impact of ice accretion in the Low Pressure Compressor of an aircraft engine during steady flight as well as during changes in altitude. Unfortunately, the algorithm as implemented was not able to distinguish throttle changes from ice accretion and thus more work remains to be done.

detection↗