Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression algorithms”

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 343 records · Page 19

AOTV bluff body flow - Relaxation algorithm

Preliminary investigations have led to the consideration of two classes of energy efficient aeroassisted orbital transfer vehicle (AOTV) concepts, with high and low L/D. The AOTV represent reentry space vehicles which are to fly hypersonically in the continuum upper reaches of the atmosphere. Problems arise in connection with convective and nonequilibrium radiative heating. As the possibilities for obtaining needed information by experimentation are limited, reliance must be placed on computational techniques to simulate testing of design concepts. A new relaxation algorithm for the compressible Navier-Stokes equations has been developed in the context of recent work with a conservative flux difference eigenvector split implicit upwind scheme CSCM (conservative supracharacteristics method). Attention is given to the CSCM implicit method, and early results for axisymmetric bluff body flow including complete forebody and base flow for a free flight range model drag brake AOTV.

Lombard, C. K.↗

Navier-Stokes computations of prolate spheroids at angle of attack

Three-dimensional viscous flow calculations are made for a 6:1 prolate spheroid at conditions for which detailed experimental data are available. The computations are made with two finite-volume algorithms for the compressible Navier-Stokes equations, one using central differencing for the convective and pressure terms and the other using an upwind-biased flux-difference-splitting approach. The effects of grid density and artificial dissipation on the accuracy of the numerical results are included. Generally good agreement of the computations with the experimental results is obtained over a range of Reynolds numbers and angles-of-attack, up to 30 deg, although the results at lower Reynolds numbers are sensitive to the assumed transition location.

Vatsa, V. N.↗

Navier-Stokes solutions about the F/A-18 forebody-LEX configuration

Three-dimensional viscous How computations are presented for the F/A-18 fore body-LEX geometry. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporates an upwind-biased, flux-difference-splitting approach along with longitudinally-patched grids. Results are presented for both laminar and fully turbulent flow assumptions and include correlations with wind tunnel as well as flight-test results. A good quantitative agreement for the forebody surface pressure distribution is achieved between the turbulent computations and wind tunnel measurements at M ∞ = 0.6. The computed turbulent surface flow patterns on the forebody qualitatively agree well with in-flight surface flow patterns obtained on an F/A-18 aircraft at M ∞ = 0.34.

Transitional flow↗

Transonic Navier-Stokes solutions about a complex high-speed accelerator configuration

Three-dimensional transonic viscous flow computations are presented for a generic high-speed accelerator model which includes wing, body, fillets, and a no-flow through engine nacelle. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporates an upwind-biased, flux-vector-splitting approach along with longitudinally-patched grids. Results are presented for fully turbulent flow assumptions and include correlations with wind tunnel data. A good quantitative agreement for the forebody surface pressure distribution is achieved between computations and the available wind-tunnel measurements at freestream Mach number equal to 0.9. Furthermore, it is demonstrated that the flow is stagnating around the boattail region due to separation from the aft-engine cowl lip.

Ghaffari, Farhad↗

Navier-Stokes solutions about the F/A-18 forebody-LEX configuration

Three-dimensional viscous How computations are presented for the F/A-18 fore body-LEX geometry. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporates an upwind-biased, flux-difference-splitting approach along with longitudinally-patched grids. Results are presented for both laminar and fully turbulent flow assumptions and include correlations with wind tunnel as well as flight-test results. A good quantitative agreement for the forebody surface pressure distribution is achieved between the turbulent computations and wind tunnel measurements at M ∞ = 0.6. The computed turbulent surface flow patterns on the forebody qualitatively agree well with in-flight surface flow patterns obtained on an F/A-18 aircraft at M ∞ = 0.34.

Farhad Ghaffari↗

Navier-Stokes solutions about the F/A-18 forebody-leading-edge extension configuration

Three-dimensional viscous flow computations are presented for the F/A-18 forebody including the leading-edge extension geometry. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations that incorporates an upwind-biased, flux-difference-splitting approach along with longitudinally patched grids. Results are presented for both laminar and fully turbulent flow assumptions and include correlations with wind-tunnel as well as flight-test results. A good quantitative agreement for the forebody surface pressure distribution is achieved between the turbulent computations and wind-tunnel measurements at M ∞ = 0.6. The computed turbulent surface flow patterns on the forebody qualitatively agree well with in-flight surface flow patterns obtained on an F/A-18 aircraft at M ∞ = 0.34

Leading edge extension↗

A robust coding scheme for packet video

We present a layered packet video coding algorithm based on a progressive transmission scheme. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

Chen, Y. C.↗

NASA Lewis steady-state heat pipe code users manual

The NASA Lewis heat pipe code was developed to predict the performance of heat pipes in the steady state. The code can be used as a design tool on a personal computer or with a suitable calling routine, as a subroutine for a mainframe radiator code. A variety of wick structures, including a user input option, can be used. Heat pipes with multiple evaporators, condensers, and adiabatic sections in series and with wick structures that differ among sections can be modeled. Several working fluids can be chosen, including potassium, sodium, and lithium, for which monomer-dimer equilibrium is considered. The code incorporates a vapor flow algorithm that treats compressibility and axially varying heat input. This code facilitates the determination of heat pipe operating temperatures and heat pipe limits that may be encountered at the specified heat input and environment temperature. Data are input to the computer through a user-interactive input subroutine. Output, such as liquid and vapor pressures and temperatures, is printed at equally spaced axial positions along the pipe as determined by the user.

Tower, Leonard K.↗

A robust coding scheme for packet video

A layered packet video coding algorithm based on a progressive transmission scheme is presented. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

Chen, Yun-Chung↗

Transonic Navier-Stokes Solutions about a Complex High-Speed Accelerator Configuration

Three dimensional transonic viscous flow computations are presented for a generic high-speed accelerator model which includes wing, body, filets,and a no-flow through engine nacelle. solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporated an upwind-biased, flux-vector-splitting approach along with longitudinally-patched grids. Results are presented for fully turbulent flow assumptions and include correlations with wind tunnel data. A good quantitative agreement for the forebody surface pressure distribution is achieved between computations and the available wind-tunnel measurements at M(sub infinity) = 0.9. Furthermore, it is demonstrated that the flow is stagnating around the boattail region due to separation from the aft-engine cowl lip.

Ghaffari, F.↗

Navier-Stokes Solutions about the F/A-18 Forebody-LEX Configuration

Three-dimensional viscous flow computations are presented for the F/A-18 forebody-LEX geometry. Solutions are obtained from an algorithm for the compressible Navier-Stokes equations which incorporates an upwind-biased, flux-difference-splitting approach along with longitudinally-patched grids. Results are presented for both laminar and fully turbulent flow assumptions and include correlations with wind tunnel as well as flight-test results. A good quantitative agreement for the forebody surface pressure distribution is achieved between the turbulent computations and wind tunnel measurements at Mach number of 0.6. The computed turbulent surface flow patterns on the forebody qualitatively agree well with in-flight surface flow patterns obtained on an F/A-fS aircraft at Mach number of 0.34.

Transitional flow↗

Computational Ghost Imaging for Remote Sensing

This work relates to the generic problem of remote active imaging; that is, a source illuminates a target of interest and a receiver collects the scattered light off the target to obtain an image. Conventional imaging systems consist of an imaging lens and a high-resolution detector array [e.g., a CCD (charge coupled device) array] to register the image. However, conventional imaging systems for remote sensing require high-quality optics and need to support large detector arrays and associated electronics. This results in suboptimal size, weight, and power consumption. Computational ghost imaging (CGI) is a computational alternative to this traditional imaging concept that has a very simple receiver structure. In CGI, the transmitter illuminates the target with a modulated light source. A single-pixel (bucket) detector collects the scattered light. Then, via computation (i.e., postprocessing), the receiver can reconstruct the image using the knowledge of the modulation that was projected onto the target by the transmitter. This way, one can construct a very simple receiver that, in principle, requires no lens to image a target. Ghost imaging is a transverse imaging modality that has been receiving much attention owing to a rich interconnection of novel physical characteristics and novel signal processing algorithms suitable for active computational imaging. The original ghost imaging experiments consisted of two correlated optical beams traversing distinct paths and impinging on two spatially-separated photodetectors: one beam interacts with the target and then illuminates on a single-pixel (bucket) detector that provides no spatial resolution, whereas the other beam traverses an independent path and impinges on a high-resolution camera without any interaction with the target. The term ghost imaging was coined soon after the initial experiments were reported, to emphasize the fact that by cross-correlating two photocurrents, one generates an image of the target. In CGI, the measurement obtained from the reference arm (with the high-resolution detector) is replaced by a computational derivation of the measurement-plane intensity profile of the reference-arm beam. The algorithms applied to computational ghost imaging have diversified beyond simple correlation measurements, and now include modern reconstruction algorithms based on compressive sensing.

Erkmen, Baris I.↗

A Framework for Compressing Unstructured Scientific Data via Serialization

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology preserving reordering of original nodes which allows for seamless integration into existing data processing pipelines. This reordering process depends solely on mesh connectivity and can be performed offline for optimal efficiency. However, the algorithm’s greedy nature also supports on-the-fly implementation. The proposed method is compatible with any compression algorithm that leverages spatial correlations within the data. The effectiveness of this approach is demonstrated on a large-scale real dataset using several compression methods, including MGARD, SZ, and ZFP.

Reshniak, Viktor [ORNL] (ORCID:0000000315454462)↗

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast and Adaptive Lossless On-Board Hyperspectral Data Compression System for Space Applications

Efficient on-board lossless hyperspectral data compression reduces the data volume necessary to meet NASA and DoD limited downlink capabilities. The techniques also improves signature extraction, object recognition and feature classification capabilities by providing exact reconstructed data on constrained downlink resources. At JPL a novel, adaptive and predictive technique for lossless compression of hyperspectral data was recently developed. This technique uses an adaptive filtering method and achieves a combination of low complexity and compression effectiveness that far exceeds state-of-the-art techniques currently in use. The JPL-developed 'Fast Lossless' algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. It is of low computational complexity and thus well-suited for implementation in hardware, which makes it practical for flight implementations of pushbroom instruments. A prototype of the compressor (and decompressor) of the algorithm is available in software, but this implementation may not meet speed and real-time requirements of some space applications. Hardware acceleration provides performance improvements of 10x-100x vs. the software implementation (about 1M samples/sec on a Pentium IV machine). This paper describes a hardware implementation of the JPL-developed 'Fast Lossless' compression algorithm on a Field Programmable Gate Array (FPGA). The FPGA implementation targets the current state of the art FPGAs (Xilinx Virtex IV and V families) and compresses one sample every clock cycle to provide a fast and practical real-time solution for Space applications.

image compression↗

Viscous compressible flow direct and inverse computation and illustrations

An algorithm for laminar and turbulent viscous compressible two dimensional flows is presented. For the application of precise boundary conditions over an arbitrary body surface, a body-fitted coordinate system is used in the physical plane. A thin-layer approximation of tne Navier-Stokes equations is introduced to keep the viscous terms relatively simple. The flow field computation is performed in the transformed plane. A factorized, implicit scheme is used to facilitate the computation. Sample calculations, for Couette flow, developing pipe flow, an isolated airflow, two dimensional compressor cascade flow, and segmental compressor blade design are presented. To a certain extent, the effective use of the direct solver depends on the user's skill in setting up the gridwork, the time step size and the choice of the artificial viscosity. The design feature of the algorithm, an iterative scheme to correct geometry for a specified surface pressure distribution, works well for subsonic flows. A more elaborate correction scheme is required in treating transonic flows where local shock waves may be involved.

Yang, T. T.↗

Hardware Implementation of Lossless Adaptive and Scalable Hyperspectral Data Compression for Space

On-board lossless hyperspectral data compression reduces data volume in order to meet NASA and DoD limited downlink capabilities. The technique also improves signature extraction, object recognition and feature classification capabilities by providing exact reconstructed data on constrained downlink resources. At JPL a novel, adaptive and predictive technique for lossless compression of hyperspectral data was recently developed. This technique uses an adaptive filtering method and achieves a combination of low complexity and compression effectiveness that far exceeds state-of-the-art techniques currently in use. The JPL-developed 'Fast Lossless' algorithm requires no training data or other specific information about the nature of the spectral bands for a fixed instrument dynamic range. It is of low computational complexity and thus well-suited for implementation in hardware. A modified form of the algorithm that is better suited for data from pushbroom instruments is generally appropriate for flight implementation. A scalable field programmable gate array (FPGA) hardware implementation was developed. The FPGA implementation achieves a throughput performance of 58 Msamples/sec, which can be increased to over 100 Msamples/sec in a parallel implementation that uses twice the hardware resources This paper describes the hardware implementation of the 'Modified Fast Lossless' compression algorithm on an FPGA. The FPGA implementation targets the current state-of-the-art FPGAs (Xilinx Virtex IV and V families) and compresses one sample every clock cycle to provide a fast and practical real-time solution for space applications.

FPGA implementation↗