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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Application of beamform to sound propagation in the atmosphere

The feasibility of applying beam-former technology (i.e., the technique that uses the combined signal from an array of sensors as a spatial filter to locate sound sources) in atmospheric acoustics is examined. Special attention is given to the microphone array, data collection, and signal processing technology as well as to an array processing algorithm. It is shown that this algorithm, which incorporates the maximum-likelihood method, is operational. Also discussed is a postprocessing algorithm for eliminating the ghosting sidelobes that arise from the moving sources.

Gerhold, Carl H.↗
NASA NTRS1993

Practical issues in implementing roving spares in VLSI systolic arrays

In this paper we address several unsolved problems in implementing roving spares as a methodology for on-line testing and reconfiguration of systolic arrays. An algorithm for distinguishing between permanent faults and intermittent/transient faults is proposed. A methodology for determining different parameter values for this algorithm is presented. Results characterizing an optimal switching structure are presented. A judicious partitioning of information (for distributed and central processing) allows design of simple switch controllers for implementing roving spares operation as well as reconfiguration in the presence of failures. Testability and self-checking capability is incorporated into these controllers using a few extra gates.

Bandekar, Rajendra↗
NASA NTRS2006

Large Array Channel Capacity in the Presence of Interference

We develop a model for a large array ground receiver system for use in deep-space communications, and analyze the resulting array channel capacity. The model includes effects of array geometry, time-dependent spacecraft orbital trajectory, point and extended interference sources, and elevation-dependent noise and tropospheric channel variations. Channel capacity is expressed as the ratio of determinants of covariance matrices characterizing source, interference, and additive noise, and then reduced to a simpler quadratic form more amenable to analysis and numerical computation. This formulation facilitates inclusion of array and channel characteristics into the model, as well as comparison of optimal, suboptimal, and equivalent single antenna configurations on achievable throughput. Realistic examples of ground array channel capacity calculations are presented, demonstrating the impact of array geometry, planetary interference sources, and array combining algorithm design upon the achievable data throughput.

Vilnrotter, V.↗
NASA NTRS2013

FPGA Vision Data Architecture

JPL has produced a series of FPGA (field programmable gate array) vision algorithms that were written with custom interfaces to get data in and out of each vision module. Each module has unique requirements on the data interface, and further vision modules are continually being developed, each with their own custom interfaces. Each memory module had also been designed for direct access to memory or to another memory module.

Morfopoulos, Arin C.↗
NASA NTRS2014

Low-Cost, Class D Testing of Spacecraft Photovoltaic Systems Can Reduce Risk

The end-to-end verification of a spacecraft photovoltaic power generation system requires light! Specifically, the standard practice for doing so is the Large Area Pulsed Solar Simulation (LAPSS). A LAPSS test can characterize a photovoltaic system's efficiency via its response to rapidly applied impulses of simulated sunlight. However, a Class D program on a constrained budget and schedule may not have the resources to ship an entire satellite for a LAPSS test alone. Such was the case with the Lunar Atmospheric and Dust Environment Explorer (LADEE) program, which was also averse to the risk of hardware damage during shipment. When the Electrical Power System (EPS) team was denied a spacecraft-level LAPSS test, the lack of an end-to-end power generation test elevated to a project-level technical risk. The team pulled together very limited resources to not only eliminate the risk, but build a process to monitor the health of the system through mission operations. We discuss a process for performing a low-cost, end-to-end test of the LADEE photovoltaic system. The approach combines system-level functional test, panel-level performance results, and periodic inspection (and repair) up until launch. Following launch, mission operations tools are utilized to assess system performance based on a scant amount of data. The process starts in manufacturing at the subcontractor. The panel manufacturer provides functional test and LAPSS data on each individual panel. We apply an initial assumption that the per-panel performance is sufficient to meet the power generation requirements. The manufacturer's data is also carried as the performance allocation for each panel during EPS system modeling and initial mission operations. During integration and test, a high-power, professional theater lamp system provides simulated sunlight to each panel on the spacecraft, thereby permitting a true end-to-end system test. A passing test results in a step response to nearly full-rated current at the appropriate solar array switch in the power system. A metal-halide bulb, infrared imagers, and onboard spacecraft measurements are utilized to minimize risk of thermal damage during test. Data is provided to support test results for both passing and marginal panels. Prior to encapsulation in the launch vehicle, each panel is inspected for damage by the panel manufacturer. Cracked cells or other damage is amended on-site. Because the photovoltaic test system is inexpensive and portable, each repaired panel can be re-verified immediately. Post-launch, the photovoltaic system is again characterized for per-panel deviations from the manufacturer's performance test. This proved especially tricky as the LADEE spacecraft performs only one current measurement on the entire array. The algorithm for Matlab tools to assess panel performance based on spacecraft attitude is discussed. While not as precise and comprehensive as LAPSS, the LADEE approach leverages minimal resources into an ongoing assessment program that can be applied through numerous stages of the mission. The project takes a true Class D approach in assessing the technical value of a spacecraft level performance test versus the programmatic risk of shipping the spacecraft to another facility. The resources required are a fraction of that for a LAPSS test, and is easy to repeat. Further, the test equipment can be handed down to future projects without building an on-site facility.

photovoltaic↗
DOE OSTI2022

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

Huang, Lianjie↗
NASA NTRS1989

Systolic VLSI array for implementing the Kalman filter algorithm

A method and apparatus for processing signals representative of a complex matrix/vector equation. More particularly, signals representing an orderly sequence of the combined matrix and vector equation, known as a Kalman filter algorithm, are processed in real time in accordance with the principles of this invention. The Kalman filter algorithm is rearranged into a Faddeeva algorithm, which is a matrix-only algorithm that is modified to represent both the matrix and vector portions of the Kalman filter algorithm. The modified Faddeeva algorithm is embodied into electrical signals which are applied as inputs to a systolic array processor. The processor performs triangulation and nullification on the input signals, and delivers an output signal which is a real-time solution to the input signals.

Jaw J Chang↗
NASA NTRS1990

Improved LMS algorithm for adaptive beamforming

Two adaptive algorithms which make use of all the available samples to estimate the required gradient are proposed and studied. The first algorithm is referred to as the recursive LMS (least mean squares) and is applicable to a general array. The second algorithm is referred to as the improved LMS algorithm and exploits the Toeplitz structure of the ACM (array correlation matrix); it can be used only for an equispaced linear array.

Godara, Lal C.↗
NASA NTRS1981

Numerical algorithms for finite element computations on arrays of microprocessors

The development of a multicolored successive over relaxation (SOR) program for the finite element machine is discussed. The multicolored SOR method uses a generalization of the classical Red/Black grid point ordering for the SOR method. These multicolored orderings have the advantage of allowing the SOR method to be implemented as a Jacobi method, which is ideal for arrays of processors, but still enjoy the greater rate of convergence of the SOR method. The program solves a general second order self adjoint elliptic problem on a square region with Dirichlet boundary conditions, discretized by quadratic elements on triangular regions. For this general problem and discretization, six colors are necessary for the multicolored method to operate efficiently. The specific problem that was solved using the six color program was Poisson's equation; for Poisson's equation, three colors are necessary but six may be used. In general, the number of colors needed is a function of the differential equation, the region and boundary conditions, and the particular finite element used for the discretization.

Ortega, J. M.↗
NASA NTRS2012

Rapid Analysis, Self-Calibrating Array for Air Monitoring

Human space missions have critical needs for monitoring and control for life support systems. These systems have monitoring needs that include feedback for closed loop processes and quality control for environmental factors. Sensors and monitoring technologies assure that the air environment and water supply for the astronaut crew habitat fall within acceptable limits, and that the life support system is functioning properly and efficiently. The longer the flight duration and the more distant the destination, the more critical it becomes to have carefully monitored and automated control systems for life support. Past experiments with the JPL ENose have demonstrated a lifetime of the sensor array, with the software, of around 18 months. The lifetime of the calibration, for some analytes, was as long as 24 months. We are working on a sensor array and new algorithms that will include sensor response time in the analysis. The preliminary array analysis for two analytes shows that the analysis time, of an event, can be dropped from 45 minutes to less than10 minutes and array training time can be cut substantially. We will describe the lifetime testing of an array and show lifetime data on individual sensors. This progress will lead to more rapid identification of analytes, and faster training time of the array.

Self Calibrating↗
NASA NTRS1989

Analysis of modified SMI method for adaptive array weight control

An adaptive array is applied to the problem of receiving a desired signal in the presence of weak interference signals which need to be suppressed. A modification, suggested by Gupta, of the sample matrix inversion (SMI) algorithm controls the array weights. In the modified SMI algorithm, interference suppression is increased by subtracting a fraction F of the noise power from the diagonal elements of the estimated covariance matrix. Given the true covariance matrix and the desired signal direction, the modified algorithm is shown to maximize a well-defined, intuitive output power ratio criterion. Expressions are derived for the expected value and variance of the array weights and output powers as a function of the fraction F and the number of snapshots used in the covariance matrix estimate. These expressions are compared with computer simulation and good agreement is found. A trade-off is found to exist between the desired level of interference suppression and the number of snapshots required in order to achieve that level with some certainty. The removal of noise eigenvectors from the covariance matrix inverse is also discussed with respect to this application. Finally, the type and severity of errors which occur in the covariance matrix estimate are characterized through simulation.

Dilsavor, R. L.↗
NASA NTRS1989

A class of parallel algorithms for computation of the manipulator inertia matrix

Parallel and parallel/pipeline algorithms for computation of the manipulator inertia matrix are presented. An algorithm based on composite rigid-body spatial inertia method, which provides better features for parallelization, is used for the computation of the inertia matrix. Two parallel algorithms are developed which achieve the time lower bound in computation. Also described is the mapping of these algorithms with topological variation on a two-dimensional processor array, with nearest-neighbor connection, and with cardinality variation on a linear processor array. An efficient parallel/pipeline algorithm for the linear array was also developed, but at significantly higher efficiency.

Fijany, Amir↗
NASA NTRS2012

Downsampling Photodetector Array with Windowing

In a photon counting detector array, each pixel in the array produces an electrical pulse when an incident photon on that pixel is detected. Detection and demodulation of an optical communication signal that modulated the intensity of the optical signal requires counting the number of photon arrivals over a given interval. As the size of photon counting photodetector arrays increases, parallel processing of all the pixels exceeds the resources available in current application-specific integrated circuit (ASIC) and gate array (GA) technology; the desire for a high fill factor in avalanche photodiode (APD) detector arrays also precludes this. Through the use of downsampling and windowing portions of the detector array, the processing is distributed between the ASIC and GA. This allows demodulation of the optical communication signal incident on a large photon counting detector array, as well as providing architecture amenable to algorithmic changes. The detector array readout ASIC functions as a parallel-to-serial converter, serializing the photodetector array output for subsequent processing. Additional downsampling functionality for each pixel is added to this ASIC. Due to the large number of pixels in the array, the readout time of the entire photodetector is greater than the time between photon arrivals; therefore, a downsampling pre-processing step is done in order to increase the time allowed for the readout to occur. Each pixel drives a small counter that is incremented at every detected photon arrival or, equivalently, the charge in a storage capacitor is incremented. At the end of a user-configurable counting period (calculated independently from the ASIC), the counters are sampled and cleared. This downsampled photon count information is then sent one counter word at a time to the GA. For a large array, processing even the downsampled pixel counts exceeds the capabilities of the GA. Windowing of the array, whereby several subsets of pixels are designated for processing, is used to further reduce the computational requirements. The grouping of the designated pixel frame as the photon count information is sent one word at a time to the GA, the aggregation of the pixels in a window can be achieved by selecting only the designated pixel counts from the serial stream of photon counts, thereby obviating the need to store the entire frame of pixel count in the gate array. The pixel count se quence from each window can then be processed, forming lower-rate pixel statistics for each window. By having this processing occur in the GA rather than in the ASIC, future changes to the processing algorithm can be readily implemented. The high-bandwidth requirements of a photon counting array combined with the properties of the optical modulation being detected by the array present a unique problem that has not been addressed by current CCD or CMOS sensor array solutions.

Patawaran, Ferze D.↗
NASA NTRS1989

Analysis of Modified SMI Method for Adaptive Array Weight Control

An adaptive array is used to receive a desired signal in the presence of weak interference signals which need to be suppressed. A modified sample matrix inversion (SMI) algorithm controls the array weights. The modification leads to increased interference suppression by subtracting a fraction of the noise power from the diagonal elements of the covariance matrix. The modified algorithm maximizes an intuitive power ratio criterion. The expected values and variances of the array weights, output powers, and power ratios as functions of the fraction and the number of snapshots are found and compared to computer simulation and real experimental array performance. Reduced-rank covariance approximations and errors in the estimated covariance are also described.

Dilsavor, Ronald Louis↗
NASA NTRS2004

Evolutionary Multiobjective Design Targeting a Field Programmable Transistor Array

This paper introduces the ISPAES algorithm for circuit design targeting a Field Programmable Transistor Array (FPTA). The use of evolutionary algorithms is common in circuit design problems, where a single fitness function drives the evolution process. Frequently, the design problem is subject to several goals or operating constraints, thus, designing a suitable fitness function catching all requirements becomes an issue. Such a problem is amenable for multi-objective optimization, however, evolutionary algorithms lack an inherent mechanism for constraint handling. This paper introduces ISPAES, an evolutionary optimization algorithm enhanced with a constraint handling technique. Several design problems targeting a FPTA show the potential of our approach.

global optimization↗
NASA NTRS1994

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗
DOE OSTI2025

A Comparison of Machine Learning Methods of Association Tested on Dense Nodal Arrays

The association of phase picks to form events is one of the fundamental components of seismology. Large and dense sensor networks, such as >1000 geophone arrays (and distributed acoustic sensing), offer unique challenges in association due to the vast numbers of observations and high likelihood of errant picks. In addition, the large number of stations can greatly increase the time it takes to perform the association. For this reason, machine learning (ML) methods might provide a more optimal method of association for such networks. In this work, we examine how well ML methods (e.g., Gaussian mixture model association, PhaseLink, and Graph Earthquake Neural Interpretation Engine) can incorporate dense seismic arrays into regional networks and how well they handle the increasing numbers of stations. Here, we test their capabilities on two dense seismic deployments, one within Rock Valley Nevada (52 nodes and a 9-station sparse local network), and the LArge-n Seismic Survey in Oklahoma dense nodal array (>1800 vertical-component geophones). Processing data from these two different styles of dense seismic deployments allows testing of how the ML algorithms can merge array data with a broader regional network, how they deal with poorly picked phases, and how they handle anthropogenic noise. We compare the ML-associated bulletins to those obtained using the Rapid Earthquake Association and Location algorithm, a more traditional method of association. We find that there are very small differences in results between the methods for small networks (<100 stations) with low pick rates. For large networks (>1000), there are enough errant picks that some of the ML methods start to create false events out of noise. We also find that the ML methods vary in computation time significantly but are all faster than the traditional method tested here.

58 GEOSCIENCES↗