Search NASA⌕ Search

SEARCH · Search NASA

Results for “Streaming 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 217 records · Page 12

AN INTRODUCTION TO THE GEONEX LEVEL-1G PRODUCTS: TOP-OF-ATMOSPHERE REFLECTANCE AND BRIGHTNESS TEMPERATURE

This paper introduces the GeoNEX (Geostationary-NASA Earth eXchange) Level-1G products of top-of-atmosphere (TOA) reflectance and brightness temperature. The products use data streams from the latest geostationary (GEO) sensors including the GOES-16/17 ABI and the Himawari-8/9 AHI. The GeoNEX processing pipeline starts by converting digital numbers to physical quantities with the latest radiometric calibration information. It integrates algorithms to automatically detect and remove residual geolocation errors, to estimate the pixel-wise data-acquisition time, and to accurately calculate the solar illumination angles for each pixel in the domain at every time step. The outputs are reprojected to a globally tiled common grid in geographic coordinates designed to facilitate inter-comparisons and/or synergies between the GeoNEX products and existing Earth observation datasets from polar-orbiting satellites. Therefore, the GeoNEX L1G products provide accurate and consistent TOA reflectance and brightness temperature datasets for scientific analyses and downstream product development.

Geostationary satellite, GOES-16, Himawari-8, NASA↗

Exact and approximate solutions to the oblique shock equations for real-time applications

The derivation of exact solutions for determining the characteristics of an oblique shock wave in a supersonic flow is investigated. Specifically, an explicit expression for the oblique shock angle in terms of the free stream Mach number, the centerbody deflection angle, and the ratio of the specific heats, is derived. A simpler approximate solution is obtained and compared to the exact solution. The primary objectives of obtaining these solutions is to provide a fast algorithm that can run in a real time environment.

Hartley, T. T.↗

An O(Nm(sup 2)) Plane Solver for the Compressible Navier-Stokes Equations

A hierarchical multigrid algorithm for efficient steady solutions to the two-dimensional compressible Navier-Stokes equations is developed and demonstrated. The algorithm applies multigrid in two ways: a Full Approximation Scheme (FAS) for a nonlinear residual equation and a Correction Scheme (CS) for a linearized defect correction implicit equation. Multigrid analyses which include the effect of boundary conditions in one direction are used to estimate the convergence rate of the algorithm for a model convection equation. Three alternating-line- implicit algorithms are compared in terms of efficiency. The analyses indicate that full multigrid efficiency is not attained in the general case; the number of cycles to attain convergence is dependent on the mesh density for high-frequency cross-stream variations. However, the dependence is reasonably small and fast convergence is eventually attained for any given frequency with either the FAS or the CS scheme alone. The paper summarizes numerical computations for which convergence has been attained to within truncation error in a few multigrid cycles for both inviscid and viscous ow simulations on highly stretched meshes.

Thomas, J. L.↗

Development of an explicit multigrid algorithm for quasi-three-dimensional viscous flows in turbomachinery

A rapid quasi three-dimensional analysis was developed for blade-to-blade flows in turbomachinery. The analysis solves the unsteady Euler or thin layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stream-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations which are solved b a two-stage Runge-Kutta scheme made efficient by use of vectorization, a variable time-step, and a flux-based multigrid scheme, are described. A stability analysis is presented for the two-stage. Results for a flat-plate model problem show the applicability of the method to axial, radial, and rotating geometries. Results for a centrifugal impeller and a radial diffuser show that the quasi three-dimensional viscous analysis can be a practical design tool.

Chima, R. V.↗

Remote Sensing techniques used to characterize soil erosion in southwestern Sao Paulo state

Within randomly sampled squares of a 1 km x 1 km grid, rill/gullies frequency, land cover/land use type and shape of the slopes were extracted from aerial photographs of the Ribeirao Anhumas drainage basin. Mean slope gradient, stream frequency and slope length were calculated on topographic maps. Ground truth data on fine sand/coarse sand ratio and vegetation cover densities were obtained. The MSS-LANDSAT-2 data (CCTs) were analyzed using single-cell, cluster synthesis and slicer algorithms. Graphical and statistical analyses of the data indicate that different slope gradients and land cover/land use types are the most significant factors related to the soil erosion process. The digital analysis of MSS data allowed the association among gray level classes and vegetation cover classes, which defined seven classes. These gray level classes and slope gradient classes were used to rank erosion risk.

Parada, N. D. J.↗

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

heterogeneous processing system↗

A System to Provide Deterministic Flight Software Operation and Maximize Multicore Processing Performance: The Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) Datapath

A method and design are described for a system that processes multiple data streams, utilizing a multicore asymmetric processing architecture, that eliminates data interrupts to the application processors. The design supports a deterministic environment for flight software in NASA’s Safe and Precise Landing – Integrated Capabilities Evolution (SPLICE) project. The SPLICE project develops sensor, algorithm, and compute technologies for Precision Landing and Hazard Avoidance (PL&HA) capabilities. The compute technology for SPLICE is the Descent and Landing Computer (DLC). The DLC hosts several SPLICE algorithms with high computational resource requirements that must be executed in a real-time and deterministic manner. The software runs on a custom Single Board Computer (SBC), with a Xilinx Ultrascale+ Multiprocessor System-on-a-Chip (MPSoC). Input data for the flight software is from a variety of sensors, unique with respect to data rate and packet size. A data path between the SPLICE sensors and algorithms is designed to efficiently deliver this data to the flight software using the MPSoC asymmetric processing cores and Field Programmable Gate Array (FPGA) fabric. This is implemented in a manner that isolates the application processors running the flight software from interrupts associated with the input data. By leveraging real-time processors on the MPSoC, and a structure with the appropriate interfaces in the shared memory on the SBC, the flight software can use the full set of application processors. The available utilization for each processor in this set is also maximized for the SPLICE applications, providing a sufficiently deterministic execution environment without the cost and overhead of a real-time operating system.

David K. Rutishauser↗

Development of an explicit multigrid algorithm for quasi-three-dimensional viscous flows in turbo-machinery

A rapid quasi three-dimensional analysis was developed for blade-to-blade flows in turbomachinery. The analysis solves the unsteady Euler or thin layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stream-surface thickness. The Baldwin-Lomax eddy-viscosity model is used for turbulent flows. The equations which are solved by a two-stage Runge-Kutta scheme made efficient by use of vectorization, a variable time-step, and a flux-based multigrid scheme, are described. A stability analysis is presented for the two-stage scheme. Results for a flat-plate model problem show the applicability of the method to axial, radial, and rotating geometries. Results for a centrifugal impeller and a radial diffuser show that the quasi three-dimensional viscous analysis can be a practical design tool.

Chima, R. V.↗

Real-time processing of radar return on a parallel computer

NASA is working with the FAA to demonstrate the feasibility of pulse Doppler radar as a candidate airborne sensor to detect low altitude windshears. The need to provide the pilot with timely information about possible hazards has motivated a demand for real-time processing of a radar return. Investigated here is parallel processing as a means of accommodating the high data rates required. A PC based parallel computer, called the transputer, is used to investigate issues in real time concurrent processing of radar signals. A transputer network is made up of an array of single instruction stream processors that can be networked in a variety of ways. They are easily reconfigured and software development is largely independent of the particular network topology. The performance of the transputer is evaluated in light of the computational requirements. A number of algorithms have been implemented on the transputers in OCCAM, a language specially designed for parallel processing. These include signal processing algorithms such as the Fast Fourier Transform (FFT), pulse-pair, and autoregressive modelling, as well as routing software to support concurrency. The most computationally intensive task is estimating the spectrum. Two approaches have been taken on this problem, the first and most conventional of which is to use the FFT. By using table look-ups for the basis function and other optimizing techniques, an algorithm has been developed that is sufficient for real time. The other approach is to model the signal as an autoregressive process and estimate the spectrum based on the model coefficients. This technique is attractive because it does not suffer from the spectral leakage problem inherent in the FFT. Benchmark tests indicate that autoregressive modeling is feasible in real time.

Aalfs, David D.↗

Optimum Transonic Airfoils Based on the Euler Equations

We solve the problem of determining airfoils that approximate, in a least square sense, given surface pressure distributions in transonic flight regimes. The flow is modeled by means of the Euler equations and the solution procedure is an adjoint- based minimization algorithm that makes use of the inverse Theodorsen transform in order to parameterize the airfoil. Fast convergence to the optimal solution is obtained by means of the pseudo-time method. Results are obtained using three different pressure distributions for several free stream conditions. The airfoils obtained have given a trailing edge angle.

Iollo, Angelo↗

Data processing in infrared astronomy

Infrared astronomy is often carried out with rocket probes or orbiting satellite telescopes in order to escape the effects of atmospheric absorption. The data returned from such missions is a highly abstracted digital representation of measurements made by analog detectors. The ability to extract infrared-emission information from these data streams depends on a thorough understanding of the information flow from the telescope aperture to the computer center. This paper reviews the primary elements of this end-to-end concept and the impact of each of these elements on the data processing algorithms, including the division between onboard and ground processing for scientific measurements.

Pelzmann, R. F., Jr.↗

Edge detection algorithm for SST images

An algorithm to detect fronts in satellite-derived sea surface temperature fields is presented. Although edge detection is the main focus, the problem of cloud detection is also addressed since unidentified clouds can lead to erroneous edge detection. The algorithm relies on a combination of methods and it operates at the picture, the window, and the local level. The resulting edge detection is not based on the absolute strength of the front, but on the relative strength depending on the context, thus, making the edge detection temperature-scale invariant. The performance of this algorithm is shown to be superior to that of simpler algorithms commonly used to locate edges in satellite-derived SST images. This evaluation was performed through a careful comparison between the location of the fronts obtained by applying the various methods to the SST images and the in situ measures of the Gulf Stream position.

Cayula, Jean-Francois↗

Compensating For Unbalance In Pulse-Code Phase Modulation

Algorithm proposed for use in pulse-code phase-modulation transmitter in which non-return-to-zero (NRZ) or biphase data modulated directly onto radio-frequency residual carrier signal. Devised to compensate somewhat for effect, upon distant receiver, of unbalance in stream of transmitted data. Formulated to compute combinations of modulation index, data rate, and transmitter power compensating for measured unbalance in transmitted data stream.

Nguyen, Tien M.↗

Artificial Boundary Conditions for Computation of Oscillating External Flows

In this paper, we propose a new technique for the numerical treatment of external flow problems with oscillatory behavior of the solution in time. Specifically, we consider the case of unbounded compressible viscous plane flow past a finite body (airfoil). Oscillations of the flow in time may be caused by the time-periodic injection of fluid into the boundary layer, which in accordance with experimental data, may essentially increase the performance of the airfoil. To conduct the actual computations, we have to somehow restrict the original unbounded domain, that is, to introduce an artificial (external) boundary and to further consider only a finite computational domain. Consequently, we will need to formulate some artificial boundary conditions (ABC's) at the introduced external boundary. The ABC's we are aiming to obtain must meet a fundamental requirement. One should be able to uniquely complement the solution calculated inside the finite computational domain to its infinite exterior so that the original problem is solved within the desired accuracy. Our construction of such ABC's for oscillating flows is based on an essential assumption: the Navier-Stokes equations can be linearized in the far field against the free-stream back- ground. To actually compute the ABC's, we represent the far-field solution as a Fourier series in time and then apply the Difference Potentials Method (DPM) of V. S. Ryaben'kii. This paper contains a general theoretical description of the algorithm for setting the DPM-based ABC's for time-periodic external flows. Based on our experience in implementing analogous ABC's for steady-state problems (a simpler case), we expect that these boundary conditions will become an effective tool for constructing robust numerical methods to calculate oscillatory flows.

Tsynkov, S. V.↗

Sampling Technique for Robust Odorant Detection Based on MIT RealNose Data

This technique enhances the detection capability of the autonomous Real-Nose system from MIT to detect odorants and their concentrations in noisy and transient environments. The lowcost, portable system with low power consumption will operate at high speed and is suited for unmanned and remotely operated long-life applications. A deterministic mathematical model was developed to detect odorants and calculate their concentration in noisy environments. Real data from MIT's NanoNose was examined, from which a signal conditioning technique was proposed to enable robust odorant detection for the RealNose system. Its sensitivity can reach to sub-part-per-billion (sub-ppb). A Space Invariant Independent Component Analysis (SPICA) algorithm was developed to deal with non-linear mixing that is an over-complete case, and it is used as a preprocessing step to recover the original odorant sources for detection. This approach, combined with the Cascade Error Projection (CEP) Neural Network algorithm, was used to perform odorant identification. Signal conditioning is used to identify potential processing windows to enable robust detection for autonomous systems. So far, the software has been developed and evaluated with current data sets provided by the MIT team. However, continuous data streams are made available where even the occurrence of a new odorant is unannounced and needs to be noticed by the system autonomously before its unambiguous detection. The challenge for the software is to be able to separate the potential valid signal from the odorant and from the noisy transition region when the odorant is just introduced.

Duong, Tuan A.↗

Development of a Global Reference Surface Reflectance and BRDF Datasets from Geostationary Satellite Observations and AERONET Measurements

Surface reflectances and their dependency on illumination-view geometries (i.e., BRDF) are the foundation of many high-level satellite products for land and water monitoring. Yet it is difficult to evaluate the quality of satellite-based surface reflectances with ground-based measurements due to the spatial scale differences. In order to fill the gap, here we develop a reference dataset of surface reflectance and BRDF at the global AERONET sites with data streams from operational geostationary sensors including Himawari 8/9 AHI, GK-2A AMI, and GOES 16/17 ABI. Taking the top-of-atmosphere (TOA) reflectance and the site measured atmospheric aerosol optical depth (AOD) as the main inputs, we apply the GeoNEX-AC algorithm to performance accurate atmospheric correction and derive 10-minute surface reflectance and daily Ross-Thick-Li-Sparse (RTLS) BRDF parameters at AERONET sites where coincident AOD measurements and TOA observations are available from 2016 (for Himawari) or 2018 (for GOES) onwards. The algorithm ensures that the retrieved surface BRDF parameters, along with the site-measured AOD, allow the atmospheric radiative transfer model, SHARM, accurately simulate the observed TOA reflectance at diurnal and longer time scales. They are our best estimates of the surface optical properties and thus can serve as the “reference” to evaluate the performance of operational atmospheric correction algorithms (where AOD is assumed unknown and needs to be retrieved). The reference BRDF also allow us to evaluate the spectral band ratios between the SWIR (e.g., 2200 nm) and the visible (e.g., 650 nm) regions, which are commonly used in operational atmospheric correction algorithms. Finally, we demonstrate that the reference dataset can be used to develop potential data synergies between different GEO satellites as well as GEO-LEO sensors.

Weile Wang↗

Relaxation and Preconditioning for High Order Discontinuous Galerkin Methods with Applications to Aeroacoustics and High Speed Flows

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. Other related issues in high order WENO finite difference and finite volume methods have also been investigated. methods are two classes of high order, high resolution methods suitable for convection dominated simulations with possible discontinuous or sharp gradient solutions. In [18], we first review these two classes of methods, pointing out their similarities and differences in algorithm formulation, theoretical properties, implementation issues, applicability, and relative advantages. We then present some quantitative comparisons of the third order finite volume WENO methods and discontinuous Galerkin methods for a series of test problems to assess their relative merits in accuracy and CPU timing. In [3], we review the development of the Runge-Kutta discontinuous Galerkin (RKDG) methods for non-linear convection-dominated problems. These robust and accurate methods have made their way into the main stream of computational fluid dynamics and are quickly finding use in a wide variety of applications. They combine a special class of Runge-Kutta time discretizations, that allows the method to be non-linearly stable regardless of its accuracy, with a finite element space discretization by discontinuous approximations, that incorporates the ideas of numerical fluxes and slope limiters coined during the remarkable development of the high-resolution finite difference and finite volume schemes. The resulting RKDG methods are stable, high-order accurate, and highly parallelizable schemes that can easily handle complicated geometries and boundary conditions. We review the theoretical and algorithmic aspects of these methods and show several applications including nonlinear conservation laws, the compressible and incompressible Navier-Stokes equations, and Hamilton-Jacobi-like equations.

Shu, Chi-Wang↗