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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

NASA NTRS2002

Estimating the Single-Trial Characteristics of Event-Related Responses: Evaluation of the MCERP Algorithm

Single-trial event-related responses collected during the course of an experiment are typically averaged before analysis resulting in a rather crude picture of event-related brain dynamics. It has been quite clear for some time that these responses exhibit trial-to-trial variability: however, the computational techniques necessary to deal with such responses in noisy conditions have not been available. To this end we have developed the multiple-component, event-related potential model (mcERP), which assumes that the each event-related response consists of a sum of multiple evoked components each described by a stereotypical waveshape. These waveshapes are allowed to vary in amplitude and onset latency from trial to trial, which allows us to capture, to first-order, the trial-dependent variations in event-related brain dynamics. We have constructed many sets of synthetic data designed to simulate intracortical recordings from a 15 channel, linear-array multielectrode implanted acutely in V1 of an awake-behaving macaque undergoing visual stimulation with a red light flash. This synthetic data was used to characterize the performance of the mcERP algorithm. First we quantified the degree to which such trial-to-trial variability aids in the identification of multiple components, and we demonstrate that amplitude variability is a more important factor in component separation than latency variability. Second, we quantified the behavior of the algorithm under two distinct signal-to-noise ratio (SNR) conditions: Gaussian noise independently present in each channel, and highly correlated (1/f distributed), far-field noise presented identically in each channel of the array. The mcERP algorithm was found to be robust to noise accurately identifying all component waveshapes and their associated single-trial characteristics down to SNR levels of -20dB for Gaussian noise and -7dB for 1/f far-field noise. Comparisons of the performance of this algorithm with factor analysis (FA) and independent component analysis (ICA) will be described by Knuth et al. (SFN abstracts, 2002). In addition, the advantages of application of mcERP to real data will be described by Shah et al, (these abstracts, 2002: SFN abstracts, 2002).

Knuth, K. H.↗

NASA NTRS1980

On the application of a fast polynomial transform and the Chinese remainder theorem to compute a two-dimensional convolution

A fast algorithm is developed to compute two dimensional convolutions of an array of d sub 1 X d sub 2 complex number points, where d sub 2 = 2(M) and d sub 1 = 2(m-r+) for some 1 or = r or = m. This algorithm requires fewer multiplications and about the same number of additions as the conventional fast fourier transform method for computing the two dimensional convolution. It also has the advantage that the operation of transposing the matrix of data can be avoided.

Truong, T. K.↗

NASA NTRS1990

On recursive least-squares filtering algorithms and implementations

In many real-time signal processing applications, fast and numerically stable algorithms for solving least-squares problems are necessary and important. In particular, under non-stationary conditions, these algorithms must be able to adapt themselves to reflect the changes in the system and take appropriate adjustments to achieve optimum performances. Among existing algorithms, the QR-decomposition (QRD)-based recursive least-squares (RLS) methods have been shown to be useful and effective for adaptive signal processing. In order to increase the speed of processing and achieve high throughput rate, many algorithms are being vectorized and/or pipelined to facilitate high degrees of parallelism. A time-recursive formulation of RLS filtering employing block QRD will be considered first. Several methods, including a new non-continuous windowing scheme based on selectively rejecting contaminated data, were investigated for adaptive processing. Based on systolic triarrays, many other forms of systolic arrays are shown to be capable of implementing different algorithms. Various updating and downdating systolic algorithms and architectures for RLS filtering are examined and compared in details, which include Householder reflector, Gram-Schmidt procedure, and Givens rotation. A unified approach encompassing existing square-root-free algorithms is also proposed. For the sinusoidal spectrum estimation problem, a judicious method of separating the noise from the signal is of great interest. Various truncated QR methods are proposed for this purpose and compared to the truncated SVD method. Computer simulations provided for detailed comparisons show the effectiveness of these methods. This thesis deals with fundamental issues of numerical stability, computational efficiency, adaptivity, and VLSI implementation for the RLS filtering problems. In all, various new and modified algorithms and architectures are proposed and analyzed; the significance of any of the new method depends crucially on specific application.

Hsieh, Shih-Fu↗

NASA NTRS1989

Unconditionally stable concurrent procedures for transient finite-element analysis

A family of algorithms was outlined which would appear to be particularly well-suited for implementation in a parallel environment. This is due to the fact that for any partition of the mesh each subdomain in the partition can be processed over a time step simultaneously and independently of the rest. The method eliminates the need for assembling and factorizing large global arrays while retaining the unconditional stability properties of the algorithms used at the local level. To critically appraise the proposed methodology, two limiting cases were considered: element-by-element mesh partitions, and coarse mesh partitions. It was concluded that while the proposed methodology can be useful in sequential machines, it would appear to be promising as it bears on computation. It should also be emphasized that extensions of the method to nonlinear problems are possible.

Ortiz, Michael↗

DOE OSTI2024

TEAMER - Field Demonstration of MarineSitu’s Marine Energy Monitoring Tools - CRADA 664 (Abstract)

In order to effectively monitor for marine life around marine energy devices and thus minimize the risk of collision, multiple sensors working in coordination and augmented with around-the-clock automated monitoring algorithms need to be installed in challenging high-energy tidal and wave environments. Such systems are often too expensive for widespread adoption, or lack sufficient sensors or smarts to enable around-the-clock, real-time monitoring without human involvement. MarineSitu has been working to tackle this problem by developing a low-cost, combined sonar and stereo camera sensor array with connected real-time AI-based algorithms for automatically detecting marine life in these marine energy suitable environments. In this TEAMER project with Pacific Northwest National Lab (PNNL), MarineSitu will be testing this novel sensor system for the first time in the high-energy tidal channel environment at PNNL’s Marine and Coastal Research Lab. Throughout this deployment, MarineSitu will be monitoring their system and running analytics on the sensor’s data in real-time. Meanwhile, PNNL Data Scientists and Ocean Engineers, will be evaluating the system’s effectiveness and ease of use both as a tool for plug-and-play environmental monitoring and novel environmental monitoring research. In doing so, the team will improve MarineSitu’s system and software, produce insightful data products, and develop novel visualizations and AI algorithms for combining and analyzing the data produced by systems like MarineSitu’s.

16 TIDAL AND WAVE POWER↗

DOE OSTI2025

TEAMER – Field Demonstration of MarineSitu’s Marine Energy Monitoring (Abstract)

16 TIDAL AND WAVE POWER↗

NASA NTRS1984

Finding maximum on an array processor with a global bus

The problem of finding the maximum of a set of values stored one/processor on an n x n array of processors is analyzed. The array has a time-shared global bus in addition to conventional processor-processor links. A two-phase algorithm for finding the maximum is presented that uses conventional links during the first phase and the global bus during the second. This algorithm is faster than algorithms that use either only the global bus or only the conventional links. Two types of interconnection patterns (the eighth nearest neighbor and the fourth nearest neighbor) are analyzed. In both cases it is shown that the time required to find the maximum using the two-phase algorithm is 0(n to the 2/3-power) assuming the propagation speed of the global bus to be a constant independent of the size of the array. In the case where the propagation speed is logarithmic in the number of processors, the time to find the maximum is 0(/n-squared log n/1/3), for both types of arrays. Extensions to q-dimensional arrays show that the two-phase algorithm is superior for any fixed value of q.

Bokhari, S. H.↗

NASA NTRS1984

Feasibility of using the Massively Parallel Processor for large eddy simulations and other Computational Fluid Dynamics applications

The results of an investigation into the feasibility of using the MPP for direct and large eddy simulations of the Navier-Stokes equations is presented. A major part of this study was devoted to the implementation of two of the standard numerical algorithms for CFD. These implementations were not run on the Massively Parallel Processor (MPP) since the machine delivered to NASA Goddard does not have sufficient capacity. Instead, a detailed implementation plan was designed and from these were derived estimates of the time and space requirements of the algorithms on a suitably configured MPP. In addition, other issues related to the practical implementation of these algorithms on an MPP-like architecture were considered; namely, adaptive grid generation, zonal boundary conditions, the table lookup problem, and the software interface. Performance estimates show that the architectural components of the MPP, the Staging Memory and the Array Unit, appear to be well suited to the numerical algorithms of CFD. This combined with the prospect of building a faster and larger MMP-like machine holds the promise of achieving sustained gigaflop rates that are required for the numerical simulations in CFD.

Bruno, John↗

NASA NTRS1973

A square-root data array solution of the continuous-discrete filtering problem

The Dyer-McReynolds (1969) discrete square-root filtering algorithm is extended to accommodate continuous dynamics. Differential equations are given to represent the time evolution of the filter data array. These equations are nonlinear, but it is shown that the nonlinearities act to enhance the stability of the solution.

Bierman, G. J.↗

DOE OSTI2025

Spectroscopic Characterization of redMaPPer Galaxy Clusters with DESI

Optical galaxy cluster identification algorithms such as redMaPPer promise to enable an array of astrophysical and cosmological studies, but suffer from biases whereby galaxies in front of and behind a galaxy cluster are mistakenly associated with the primary cluster halo. These projection effects caused by irreducible photometric redshift uncertainty must be quantified to facilitate the use of optical cluster catalogues. We present measurements of galaxy cluster projection effects and velocity dispersion using spectroscopy from the Dark Energy Spectroscopic Instrument. Our findings are as follows: we confirm that the fraction of redMaPPer putative member galaxies mistakenly associated with cluster haloes is richness dependent, being more than twice as large at low richness than high richness; we present the first spectroscopic evidence of an increase in projection effects with increasing redshift, by as much as 25 per cent from $z\sim 0.1$ to $z\sim 0.2$; moreover, we find qualitative evidence for luminosity dependence in projection effects, with fainter galaxies being more commonly far behind clusters than their bright counterparts; finally, we fit the scaling relation between measured mean spectroscopic richness and velocity dispersion, finding an implied linear scaling between spectroscopic richness and halo mass. We discuss further directions for the application of spectroscopic data sets to improve use of optically selected clusters to test cosmological models.

clusters↗

NASA NTRS1981

SAR processing on the MPP

The processing of synthetic aperture radar (SAR) signals using the massively parallel processor (MPP) is discussed. The fast Fourier transform convolution procedures employed in the algorithms are described. The MPP architecture comprises an array unit (ARU) which processes arrays of data; an array control unit which controls the operation of the ARU and performs scalar arithmetic; a program and data management unit which controls the flow of data; and a unique staging memory (SM) which buffers and permutes data. The ARU contains a 128 by 128 array of bit-serial processing elements (PE). Two-by-four surarrays of PE's are packaged in a custom VLSI HCMOS chip. The staging memory is a large multidimensional-access memory which buffers and permutes data flowing with the system. Efficient SAR processing is achieved via ARU communication paths and SM data manipulation. Real time processing capability can be realized via a multiple ARU, multiple SM configuration.

Batcher, K. E.↗

NASA NTRS1983

A performance analysis of the PASLIB version 2.1X SEND and RECV routines on the finite element machine

The Finite Element Machine is an experimental array processor designed to support research in parallel algorithms and architectures. This report presents a case study of communications using the SENDa and RECV system software routines on the Finite Element Machine, followed by a discussion of the effect of I/O performance on the efficiency of parallel algorithms.

Knott, J. D.↗

NASA NTRS1991

Error analysis of image reconstruction by a synthetic aperture interferometric radiometer

An error analysis is presented for the image reconstruction algorithm currently employed by the electronically steered thinned array radiometer aircraft instrument. This instrument samples components of the Fourier transform of the brightness temperature distribution at 1.4 GHz. Sources of error are identified, including systematic offsets and stochastic noise in the measurements, errors in the interference pattern antenna calibration, multipath scattering from the antenna support structure, mutual coupling between nearby array elements, and variations in the antenna patterns of the array elements. These errors are shown to produce artifacts in the image which appear as 'streaks' running along the instrument flight line. Possible hardware corrections are discussed. These include a reduction in the profile of the antenna support structure and a decoupling of adjacent and other nearby array elements using corrugated 'skirts'. Also discussed are several image enhancement techniques which detect and correct for some of the streaking. These techniques include a renormalization of the interference patterns based on the measured element patterns, a perturbation based interpretation of image contrast, and a covariance analysis of noise present in the image.

Ruf, Christopher S.↗

NASA NTRS2001

Chandra Space Flight Software: Using Software to Autonomously Operation the Largest and Most Sensitive X-Ray Telescope in the World

Chandra is the world's largest and most sensitive X-ray telescope. The Chandra X-ray Observatory is the third in NASA's family of "Great Observatories." The Chandra X-ray Observatory, launched by Space Shuttle Columbia on July 23, 1999, is NASA's newest Great Observatory. The Chandra space flight software is the operational software, which controls and directs the Chandra X-ray Observatory. The Chandra flight software has executed faultlessly for over 13,000 hours on-orbit. The Chandra flight software directly controls the Pointing, Aspect Determination, Electrical Power Subsystem, Propulsion system, and the Command, Communications, and Data Management subsystems. The software controls the spacecraft operations during all phases of the mission. The software also performs thermal control of the telescope to maintain pointing accuracy and monitors radiation levels throughout the orbit so that the Science Instruments can be safed if radiation thresholds are exceeded. The efficient operation of Chandra flight software has enabled the gathering of crucial science data. The Chandra flight software fault protection is the key to early detection and prevention of science instrument or spacecraft damage in an operating platform/environment, which is completely unforgiving. Permanently open Sun Shade Door and ACIS focal plane radiator sensitivity exposes science instruments and mirrors to damage for pointing anomalies causing an attitude excursion. The Chandra flight software must prevent these attitude excursions from occurring for ANY failure. Another example is that the power system has an unregulated bus, which imposes severe operating requirements on Chandra flight software to control array pointing and battery connection/disconnect using a unique algorithmic and logic approach. The Chandra flight software has enabled a truly autonomous vehicle with greater than 99% of all mission data collected as planned. Less than 15% of spacecraft operations are conducted in view (1 hour out of 8) leading to very extended periods without ground contact. The Chandra flight software implements the flexible mission plan during this out of view period, manages the solid state recorder capacity, controls all pointing and maneuvers, provides fault detection for all satellite subsystems, and initiates communications with the ground at the appropriate time. This paper will describe the software architecture features, key design elements and software testing techniques that have facilitated Chandra's success.

Crumbley, Tim↗

NASA NTRS2004

Orbiter Interface Unit and Early Communication System

This report describes the Orbiter Interface Unit (OIU) and the Early Communication System (ECOMM), which are systems of electronic hardware and software that serve as the primary communication links for the International Space Station (ISS). When a space shuttle is at or near the ISS during assembly and resupply missions, the OIU sends groundor crew-initiated commands from the space shuttle to the ISS and relays telemetry from the ISS to the space shuttle s payload data systems. The shuttle then forwards the telemetry to the ground. In the absence of a space shuttle, the ECOMM handles communications between the ISS and Johnson Space Center via the Tracking and Data Relay Satellite System (TDRSS). Innovative features described in the report include (1) a "smart data-buffering algorithm that helps to preserve synchronization (and thereby minimize loss) of telemetric data between the OIU and the space-shuttle payload data interleaver; (2) an ECOMM antenna-autotracking algorithm that selects whichever of two phased-array antennas gives the best TDRSS signal and electronically steers that antenna to track the TDRSS source; and (3) an ECOMM radiation-latchup controller, which detects an abrupt increase in current indicative of radiation-induced latchup and temporarily turns off power to clear the latchup, restoring power after the charge dissipates.

Cobbs, Ronald M.↗

NASA NTRS2012

Synthesis Study of a 6-Element Non-Uniform Array with Tilted Elements for CLARREO Project

This paper presents the results of a preliminary study of the gain/pattern properties of a 6-element Radio Occultation (RO) array for the proposed CLARREO (Climate Absolute Radiance and Refractivity Observatory (CLARREO) Project. CLARREO is one of the 4 highest priority missions recommended in the National Research Council Earth Science Decadal Survey.

spatial arrays↗

NASA NTRS2016

Correcting GOES-R Magnetometer Data for Stray Fields

Time-varying spacecraft magnetic fields, i.e. stray fields, are a problem for magnetometer systems. While constant fields can be removed by calibration, stray fields are difficult to distinguish from ambient field variations. Putting two magnetometers on a long boom and solving for both the ambient and stray fields can help, but this gradiometer solution is more sensitive to noise than a single magnetometer. As shown here for the R-series Geostationary Operational Environmental Satellites (GOES-R), unless the stray fields are larger than the noise, simply averaging the two magnetometer readings gives a more accurate solution. If averaging is used, it may be worthwhile to estimate and remove stray fields explicitly. Models and estimation algorithms to do so are provided for solar array, arcjet and reaction wheel fields.

Magnetometer↗

DOE OSTI2022

A Length Adaptive Algorithm-Hardware Co-design of Transformer on FPGA Through Sparse Attention and Dynamic Pipelining

Transformers are considered one of the most important deep learning models since 2018, in part because it establishes state-of-the-art (SOTA) records and could potentially replace existing Deep Neural Networks (DNNs). Despite the remarkable triumphs, the prolonged turnaround time of Transformer models is a widely recognized roadblock. The variety of sequence lengths imposes additional computing overhead where inputs need to be zero-padded to the maximum sentence length in the batch to accommodate the parallel computing platforms. This paper targets the field-programmable gate array (FPGA) and proposes a coherent sequence length adaptive algorithm–hardware co-design for Transformer acceleration. Particularly, we develop a hardware-friendly sparse attention operator and a length-aware hardware resource scheduling algorithm. The proposed sparse attention operator brings the complexity of attention-based models down to linear complexity and alleviates the off-chip memory traffic. The proposed length-aware resource hardware scheduling algorithm dynamically allocates the hardware resources to fill up the pipeline slots and eliminates bubbles for NLP tasks. Experiments show that our design has very small accuracy loss and has 80.2 × and 2.6 × speedup compared to CPU and GPU implementation, and 4 × higher energy efficiency than state-of-the-art GPU accelerator optimized via CUBLAS GEMM.

Peng, Hongwu↗