Search NASA⌕ Search

SEARCH · Search NASA

Results for “arraying 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Hardware Implementation of Lossless Adaptive Compression of Data From a Hyperspectral Imager

Efficient onboard data compression can reduce the data volume from hyperspectral imagers on NASA and DoD spacecraft in order to return as much imagery as possible through constrained downlink channels. Lossless compression is important for signature extraction, object recognition, and feature classification capabilities. To provide onboard data compression, a hardware implementation of a lossless hyperspectral compression algorithm was developed using a field programmable gate array (FPGA). The underlying algorithm is the Fast Lossless (FL) compression algorithm reported in Fast Lossless Compression of Multispectral- Image Data (NPO-42517), NASA Tech Briefs, Vol. 30, No. 8 (August 2006), p. 26 with the modification reported in Lossless, Multi-Spectral Data Comressor for Improved Compression for Pushbroom-Type Instruments (NPO-45473), NASA Tech Briefs, Vol. 32, No. 7 (July 2008) p. 63, which provides improved compression performance for data from pushbroom-type imagers. An FPGA implementation of the unmodified FL algorithm was previously developed and reported in Fast and Adaptive Lossless Onboard Hyperspectral Data Compression System (NPO-46867), NASA Tech Briefs, Vol. 36, No. 5 (May 2012) p. 42. The essence of the FL algorithm is adaptive linear predictive compression using the sign algorithm for filter adaption. The FL compressor achieves a combination of low complexity and compression effectiveness that exceeds that of stateof- the-art techniques currently in use. The modification changes the predictor structure to tolerate differences in sensitivity of different detector elements, as occurs in pushbroom-type imagers, which are suitable for spacecraft use. The FPGA implementation offers a low-cost, flexible solution compared to traditional ASIC (application specific integrated circuit) and can be integrated as an intellectual property (IP) for part of, e.g., a design that manages the instrument interface. The FPGA implementation was benchmarked on the Xilinx Virtex IV LX25 device, and ported to a Xilinx prototype board. The current implementation has a critical path of 29.5 ns, which dictated a clock speed of 33 MHz. The critical path delay is end-to-end measurement between the uncompressed input data and the output compression data stream. The implementation compresses one sample every clock cycle, which results in a speed of 33 Msample/s. The implementation has a rather low device use of the Xilinx Virtex IV LX25, making the total power consumption of the implementation about 1.27 W.

Keymeulen, Didlier↗
NASA NTRS2013

Faster Array Training and Rapid Analysis for a Sensor Array Intended for an Event Monitor in Air

Environmental monitoring, in particular, air monitoring, is a critical need for human space flight. Both monitoring and life support systems have needs for closed loop process feedback and quality control for environmental factors. Monitoring protects the air environment and water supply for the astronaut crew and different sensors help ensure that the habitat falls within acceptable limits, and that the life support system is functioning properly and efficiently. The longer the flight duration and the farther the destination, the more critical it becomes to have carefully monitored and automated control systems for life support. There is an acknowledged need for an event monitor which samples the air continuously and provides near real-time information on changes in the air. Past experiments with the JPL ENose have demonstrated a lifetime of the sensor array, with the software, of around 18 months. We are working on a sensor array and new algorithms that will incorporate transient sensor responses in the analysis. Preliminary work has already showed more rapid quantification and identification of analytes and the potential for faster training time of the array. We will look at some of the factors that contribute to demonstrating faster training time for the array. Faster training will decrease the integrated sensor exposure to training analytes, which will also help extend sensor lifetime.

sensing array↗
NASA NTRS2002

A Lightning Channel Retrieval Algorithm for the North Alabama Lightning Mapping Array (LMA)

A new multi-station VHF time-of-arrival (TOA) antenna network is, at the time of this writing, coming on-line in Northern Alabama. The network, called the Lightning Mapping Array (LMA), employs GPS timing and detects VHF radiation from discrete segments (effectively point emitters) that comprise the channel of lightning strokes within cloud and ground flashes. The network will support on-going ground validation activities of the low Earth orbiting Lightning Imaging Sensor (LIS) satellite developed at NASA Marshall Space Flight Center (MSFC) in Huntsville, Alabama. It will also provide for many interesting and detailed studies of the distribution and evolution of thunderstorms and lightning in the Tennessee Valley, and will offer many interesting comparisons with other meteorological/geophysical wets associated with lightning and thunderstorms. In order to take full advantage of these benefits, it is essential that the LMA channel mapping accuracy (in both space and time) be fully characterized and optimized. In this study, a new revised channel mapping retrieval algorithm is introduced. The algorithm is an extension of earlier work provided in Koshak and Solakiewicz (1996) in the analysis of the NASA Kennedy Space Center (KSC) Lightning Detection and Ranging (LDAR) system. As in the 1996 study, direct algebraic solutions are obtained by inverting a simple linear system of equations, thereby making computer searches through a multi-dimensional parameter domain of a Chi-Squared function unnecessary. However, the new algorithm is developed completely in spherical Earth-centered coordinates (longitude, latitude, altitude), rather than in the (x, y, z) cartesian coordinates employed in the 1996 study. Hence, no mathematical transformations from (x, y, z) into spherical coordinates are required (such transformations involve more numerical error propagation, more computer program coding, and slightly more CPU computing time). The new algorithm also has a more realistic definition of source altitude that accounts for Earth oblateness (this can become important for sources that are hundreds of kilometers away from the network). In addition, the new algorithm is being applied to analyze computer simulated LMA datasets in order to obtain detailed location/time retrieval error maps for sources in and around the LMA network. These maps will provide a more comprehensive analysis of retrieval errors for LMA than the 1996 study did of LDAR retrieval errors. Finally, we note that the new algorithm can be applied to LDAR, and essentially any other multi-station TWA network that depends on direct line-of-site antenna excitation.

Koshak, William↗
NASA NTRS1991

Computations on the massively parallel processor at the Goddard Space Flight Center

Described are four significant algorithms implemented on the massively parallel processor (MPP) at the Goddard Space Flight Center. Two are in the area of image analysis. Of the other two, one is a mathematical simulation experiment and the other deals with the efficient transfer of data between distantly separated processors in the MPP array. The first algorithm presented is the automatic determination of elevations from stereo pairs. The second algorithm solves mathematical logistic equations capable of producing both ordered and chaotic (or random) solutions. This work can potentially lead to the simulation of artificial life processes. The third algorithm is the automatic segmentation of images into reasonable regions based on some similarity criterion, while the fourth is an implementation of a bitonic sort of data which significantly overcomes the nearest neighbor interconnection constraints on the MPP for transferring data between distant processors.

Strong, James P.↗
NASA NTRS1993

MeV Gamma Ray Detection Algorithms for Stacked Silicon Detectors

By making use of the signature of a gamma ray event as it appears in N = 5 to 20 lithium-drifted silicon detectors and applying smart selection algorithms, gamma rays in the energy range of 1 to 8 MeV can be detected with good efficiency and selectivity. Examples of the types of algorithms used for different energy regions include the simple sum mode, the sum-coincidence mode used in segmented detectors, unique variations on sum-coincidence for an N-dimensional vector event, and a new and extremely useful mode for double escape peak spectroscopy at pair-production energies. The latter algorithm yields a spectrum similar to that of the pair spectrometer, but without the need of the dual external segments for double escape coincidence, and without the large loss in efficiency of double escape events. Background events due to Compton scattering are largely suppressed. Monte Carlo calculations were used to model the gamma ray interactions in the silicon, in order to enable testing of a wide array of different algorithms on the event N-vectors for a large-N stack.

McMurray, Robert E. Jr.↗
NASA NTRS2019

Machine Learning, Markov Chain Monte Carlo, and Optimal Algorithms to Characterize the AdvACT Kilopixel Transition-Edge Sensor Arrays

Next-generation focal planes comprising dozens of kilopixel transition-edge sensor (TES) arrays require new methods to rapidly screen candidate arrays, evaluate array non-idealities in the field, identify outlier devices for removal, and optimize the array performance in the field. We demonstrate robust methods to estimate TES parameters (critical temperatures and thermal conductivity parameters) and their uncertainties using a custom Markov Chain Monte Carlo (MCMC) algorithm. We also constrain systematic effects in estimating the TES parameters from non-isothermal current-voltage curves (IVs) at approximately a ~3% level. Additionally, for the first time, we have applied Machine Learning (ML) algorithms to tune detector arrays and optimize their performance.

Maria Salatino↗
NASA NTRS2009

Synchronized Position Hold, Engage, Reorient, Experimental Satellites

Synchronized Position Hold, Engage, Reorient, Experimental Satellites (SPHERES) are bowling-ball sized spherical satellites. They will be used inside the space station to test a set of well-defined instructions for spacecraft performing autonomous rendezvous and docking maneuvers. Three free-flying spheres will fly within the cabin of the station, performing flight formations. Each satellite is self-contained with power, propulsion, computers and navigation equipment. The results are important for satellite servicing, vehicle assembly and formation flying spacecraft configurations. SPHERES is a testbed for formation flying by satellites, the theories and calculations that coordinate the motion of multiple bodies maneuvering in microgravity. To achieve this inside the ISS cabin, bowling-ball-sized spheres perform various maneuvers (or protocols), with one to three spheres operating simultaneously . The Synchronized Position Hold, Engage, Reorient, Experimental Satellites (SPHERES) experiment will test relative attitude control and station-keeping between satellites, re-targeting and image plane filling maneuvers, collision avoidance and fuel balancing algorithms, and an array of geometry estimators used in various missions. SPHERES consists of three self-contained satellites, which are 18 sided polyhedrons that are 0.2 meter in diameter and weigh 3.5 kilograms. Each satellite contains an internal propulsion system, power, avionics, software, communications, and metrology subsystems. The propulsion system uses CO2, which is expelled through the thrusters. SPHERES satellites are powered by AA batteries. The metrology subsystem provides real-time position and attitude information. To simulate ground station-keeping, a laptop will be used to transmit navigational data and formation flying algorithms. Once these data are uploaded, the satellites will perform autonomously and hold the formation until a new command is given.

Miller, David W.↗
NASA NTRS1987

SMI adaptive antenna arrays for weak interfering signals

The performance of adaptive antenna arrays is studied when a sample matrix inversion (SMI) algorithm is used to control array weights. It is shown that conventional SMI adaptive antennas, like other adaptive antennas, are unable to suppress weak interfering signals (below thermal noise) encountered in broadcasting satellite communication systems. To overcome this problem, the SMI algorithm is modified. In the modified algorithm, the covariance matrix is modified such that the effect of thermal noise on the weights of the adaptive array is reduced. Thus, the weights are dictated by relatively weak coherent signals. It is shown that the modified algorithm provides the desired interference protection. The use of defocused feeds as auxiliary elements of an SMI adaptive array is also discussed.

Gupta, I. J.↗
DOE OSTI2022

Future energy infrastructure, energy platform and energy storage

Today fossil energy dominates energy consumption across the world. There has been an increasing momentum to reduce fossil energy consumption and increase renewable energy utilization to more than 70%. Such high penetrations of distributed renewable resources bring large uncertainty and complexity that cannot be easily handled by the current infrastructure. For the last two decades, telecommunication industry has gone through a similar transition from centralized to distributed systems, and more recently to platform approaches, which become the corner stone of today’s vibrant platform economy. Based on telecommunication history, we believe that a platform-based approach, called the energy platform, is a viable solution for addressing the renewable energy challenges. The energy platform consists of an array of computational algorithms, sensing and control technologies for key industry, energy generators and users to jointly manage and control the complex energy infrastructure. It includes the following key components: (1) the hardware and software to generate, store, control and transmit electricity/data (the energy cloud), (2) the digital platforms and tools for key energy producers, digital, service and communication industry to share the assets, participate in and manage the complex infrastructure, and for customers to participate in energy transactions, (3) the transaction platform for new service and business models. Additionally, the energy platform requires breakthroughs in large scale energy storage and many other areas including efficient power electronics, sensors and controls, new mathematical and computational tools, and deep integration of energy technologies and information sciences to control and stabilize such complex chaotic systems.

25 ENERGY STORAGE↗
DOE OSTI2025

Reproducibility of fixed-node diffusion Monte Carlo across diverse community codes: The case of water–methane dimer

Fixed-node diffusion quantum Monte Carlo (FN-DMC) is a widely trusted many-body method for solving the Schrödinger equation, known for its reliable predictions of material and molecular properties. Furthermore, its excellent scalability with system complexity and near-perfect utilization of computational power make FN-DMC ideally positioned to leverage new advances in computing to address increasingly complex scientific problems. Even though the method is widely used as a computational gold standard, reproducibility across the numerous FN-DMC code implementations has yet to be demonstrated. This difficulty stems from the diverse array of DMC algorithms and trial wave functions, compounded by the method’s inherent stochastic nature. Here, this study represents a community-wide effort to assess the reproducibility of the method, affirming that yes, FN-DMC is reproducible (when handled with care). Using the water–methane dimer as the canonical test case, we compare results from eleven different FN-DMC codes and show that the approximations to treat the non-locality of pseudopotentials are the primary source of the discrepancies between them. In particular, we demonstrate that, for the same choice of determinantal component in the trial wave function, reliable and reproducible predictions can be achieved by employing the T-move, the determinant locality approximation, or the determinant T-move schemes, while the older locality approximation leads to considerable variability in results. These findings demonstrate that, with appropriate choices of algorithmic details, fixed-node DMC is reproducible across diverse community codes—highlighting the maturity and robustness of the method as a tool for open and reliable computational science.

Della Pia, Flaviano [Univ. of Cambridge (United Ki↗
NASA NTRS1999

Segmented Mirror Image Degradation Due to Surface Dust, Alignment and Figure

In 1996 an algorithm was developed to include the effects of surface roughness in the calculation of the point spread function of a telescope mirror. This algorithm has been extended to include the effects of alignment errors and figure errors for the individual elements, and an overall contamination by surface dust. The final algorithm builds an array for a guard-banded pupil function of a mirror that may or may not have a central hole, a central reflecting segment, or an outer ring of segments. The central hole, central reflecting segment, and outer ring may be circular or polygonal, and the outer segments may have trimmed comers. The modeled point spread functions show that x-tilt and y-tilt, or the corresponding R-tilt and theta-tilt for a segment in an outer ring, is readily apparent for maximum wavefront errors of 0.1 lambda. A similar sized piston error is also apparent, but integral wavelength piston errors are not. Severe piston error introduces a focus error of the opposite sign, so piston could be adjusted to compensate for segments with varying focal lengths. Dust affects the image principally by decreasing the Strehl ratio, or peak intensity of the image. For an eight-meter telescope a 25% coverage by dust produced a scattered light intensity of 10(exp -9) of the peak intensity, a level well below detectability.

Schreur, Julian J.↗
NASA NTRS2014

High-Speed On-Board Data Processing for Science Instruments

A new development of on-board data processing platform has been in progress at NASA Langley Research Center since April, 2012, and the overall review of such work is presented in this paper. The project is called High-Speed On-Board Data Processing for Science Instruments (HOPS) and focuses on a high-speed scalable data processing platform for three particular National Research Council's Decadal Survey missions such as Active Sensing of CO2 Emissions over Nights, Days, and Seasons (ASCENDS), Aerosol-Cloud-Ecosystems (ACE), and Doppler Aerosol Wind Lidar (DAWN) 3-D Winds. HOPS utilizes advanced general purpose computing with Field Programmable Gate Array (FPGA) based algorithm implementation techniques. The significance of HOPS is to enable high speed on-board data processing for current and future science missions with its reconfigurable and scalable data processing platform. A single HOPS processing board is expected to provide approximately 66 times faster data processing speed for ASCENDS, more than 70% reduction in both power and weight, and about two orders of cost reduction compared to the state-of-the-art (SOA) on-board data processing system. Such benchmark predictions are based on the data when HOPS was originally proposed in August, 2011. The details of these improvement measures are also presented. The two facets of HOPS development are identifying the most computationally intensive algorithm segments of each mission and implementing them in a FPGA-based data processing board. A general introduction of such facets is also the purpose of this paper.

Beyon, Jeffrey Y.↗
NASA NTRS2011

Micro-Pixel Image Position Sensing Testbed

The search for Earth-mass planets in the habitable zones of nearby Sun-like stars is an important goal of astrophysics. This search is not feasible with the current slate of astronomical instruments. We propose a new concept for microarcsecond astrometry which uses a simplified instrument and hence promises to be low cost. The concept employs a telescope with only a primary, laser metrology applied to the focal plane array, and new algorithms for measuring image position and displacement on the focal plane. The required level of accuracy in both the metrology and image position sensing is at a few micro-pixels. We have begun a detailed investigation of the feasibility of our approach using simulations and a micro-pixel image position sensing testbed called MCT. So far we have been able to demonstrate that the pixel-to-pixel distances in a focal plane can be measured with a precision of 20 micro-pixels and image-to-image distances with a precision of 30 micro-pixels. We have also shown using simulations that our image position algorithm can achieve accuracy of 4 micro-pixels in the presence of lambda/20 wavefront errors.

astrometry↗
NASA NTRS1971

A stochastic constrained optimization technique and its application to detector array processing.

A stochastic projected gradient algorithm is proposed which can be used for finding a constrained optimum point for a concave or convex objective function subject to nonlinear constraints which form a connected region even when only a noisy estimate of the objective function is available. For a constraint described by a single linear equation, convergence to the constrained optimum value is proved, and the rate of convergence of the algorithm to the constrained optimum value is determined. The algorithm is applied to the nonlinear problem of obtaining automatically an array of detectors which forms a beam in a desired direction in space in the presence of interfering noise so as to maximize the SNR subject to a constraint on the super-gain ratio.

Winkler, L. P.↗
NASA NTRS1984

Near field to far field transformations and multiple beam forming and steering

The feasibility of acoustic verification of microwave near field to far field transformation algorithms using the Phased Array Sonic Simulation System was studied. Existing electromagnetic near field measurement techniques and transformation algorithms (equations) were investigated. It was analytically determined that acoustic verification is valid. Acoustic simulation of electromagnetic near field to far field transformations is emphasized. The acoustic simulation of electromagnetic near field to far field transformation is verified for the modal expansion method. In the modal expansion method, data from antenna near field measurements are converted to a summation or spectrum of modes corresponding to wave numbers in the measurement coordinate system. Fourier transformation of those measurements preserves the far field information in a spectral form that is then readily extractable.

Source record↗
NASA NTRS1989

A family of new efficient arrays for matrix multiplication

The authors present a regular iterative algorithm for matrix multiplication and show that several well-known matrix multiplication arrays are directly obtained from it, differing only in the choice of iteration vector. They then present a regular iterative algorithm for matrix multiplication using the method of Winograd (1968) and show in detail how to derive one array from this algorithmic description. Other arrays in the same family can similarly be obtained for different choices of the iteration space. The new arrays compute the product of two matrices faster than available conventional arrays and use a smaller number of processor cells.

Jagadish, H. V.↗
NASA NTRS1981

Contextual classification on a CDC Flexible Processor system

A potential hardware organization for the Flexible Processor Array is presented. An algorithm that implements a contextual classifier for remote sensing data analysis is given, along with uniprocessor classification algorithms. The Flexible Processor algorithm is provided, as are simulated timings for contextual classifiers run on the Flexible Processor Array and another system. The timings are analyzed for context neighborhoods of sizes three and nine.

Smith, B. W.↗