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 55 records · Page 3

A survey of the state of the art and focused research in range systems, task 2

Contract generated publications are compiled which describe the research activities for the reporting period. Study topics include: equivalent configurations of systolic arrays; least squares estimation algorithms with systolic array architectures; modeling and equilization of nonlinear bandlimited satellite channels; and least squares estimation and Kalman filtering by systolic arrays.

Yao, K.↗

Application of adaptive least-squares algorithm to multi-element array signal reconstruction

Results are presented in terms of the performance improvement of a multi-feed array configuration over the usual single feed system when an adaptive least-squares algorithm is applied for the signal reconstruction. Two versions of the least-squares algorithm are presented, one of which is based on the maximization of the signal-to-noise ratio while the other is based on the deconvolution of received signal field. These algorithms were developed for the purpose of minimizing degradations arising from various sources, which can severely limit the performance (gain) of a single-feed system.

Kumar, R.↗

A boundary finding algorithm and its applications

An algorithm for locating gray level and/or texture edges in digitized pictures is presented. The algorithm is based on the concept of hypothesis testing. The digitized picture is first subdivided into subsets of picture elements, e.g., 2 x 2 arrays. The algorithm then compares the first- and second-order statistics of adjacent subsets; adjacent subsets having similar first- and/or second-order statistics are merged into blobs. By continuing this process, the entire picture is segmented into blobs such that the picture elements within each blob have similar characteristics. The boundaries between the blobs comprise the boundaries. The algorithm always generates closed boundaries. The algorithm was developed for multispectral imagery of the earth's surface. Application of this algorithm to various image processing techniques such as efficient coding, information extraction (terrain classification), and pattern recognition (feature selection) are included.

Gupta, J. N.↗

Overview of NASA's MODIS and Visible Infrared Imaging Radiometer Suite (VIIRS) snow-cover Earth System Data Records

Knowledge of the distribution, extent, duration and timing of snowmelt is critical for characterizing the Earth's climate system and its changes. As a result, snow cover is one of the Global Climate Observing System (GCOS) essential climate variables (ECVs). Consistent, long-term datasets of snow cover are needed to study interannual variability and snow climatology. The NASA snow-cover datasets generated from the Moderate Resolution Imaging Spectroradiometer (MODIS) on the Terra and Aqua spacecraft and the Suomi National Polar-orbiting Partnership (S-NPP) Visible Infrared Imaging Radiometer Suite (VIIRS) are NASA Earth System Data Records (ESDR). The objective of the snow-cover detection algorithms is to optimize the accuracy of mapping snow-cover extent (SCE) and to minimize snow-cover detection errors of omission and commission using automated, globally applied algorithms to produce SCE data products. Advancements in snow-cover mapping have been made with each of the four major reprocessings of the MODIS data record, which extends from 2000 to the present. MODIS Collection 6 (C6) and VIIRS Collection 1 (C1) represent the state-of-the-art global snow cover mapping algorithms and products for NASA Earth science. There were many revisions made in the C6 algorithms which improved snow-cover detection accuracy and information content of the data products. These improvements have also been incorporated into the NASA VIIRS snow cover algorithms for C1. Both information content and usability were improved by including the Normalized Snow Difference Index (NDSI) and a quality assurance (QA) data array of algorithm processing flags in the data product, along with the SCE map.The increased data content allows flexibility in using the datasets for specific regions and end-user applications.Though there are important differences between the MODIS and VIIRS instruments (e.g., the VIIRS 375m native resolution compared to MODIS 500 m), the snow detection algorithms and data products are designed to be as similar as possible so that the 16C year MODIS ESDR of global SCE can be extended into the future with the S-NPP VIIRS snow products and with products from future Joint Polar Satellite System (JPSS) platforms.These NASA datasets are archived and accessible through the NASA Distributed Active Archive Center at the National Snow and Ice Data Center in Boulder, Colorado.

Earth System Data Record↗

DFT algorithms for bit-serial GaAs array processor architectures

Systems and Processes Engineering Corporation (SPEC) has developed an innovative array processor architecture for computing Fourier transforms and other commonly used signal processing algorithms. This architecture is designed to extract the highest possible array performance from state-of-the-art GaAs technology. SPEC's architectural design includes a high performance RISC processor implemented in GaAs, along with a Floating Point Coprocessor and a unique Array Communications Coprocessor, also implemented in GaAs technology. Together, these data processors represent the latest in technology, both from an architectural and implementation viewpoint. SPEC has examined numerous algorithms and parallel processing architectures to determine the optimum array processor architecture. SPEC has developed an array processor architecture with integral communications ability to provide maximum node connectivity. The Array Communications Coprocessor embeds communications operations directly in the core of the processor architecture. A Floating Point Coprocessor architecture has been defined that utilizes Bit-Serial arithmetic units, operating at very high frequency, to perform floating point operations. These Bit-Serial devices reduce the device integration level and complexity to a level compatible with state-of-the-art GaAs device technology.

Mcmillan, Gary B.↗

Coherent Detection of High-Rate Optical PPM Signals

A method of coherent detection of high-rate pulse-position modulation (PPM) on a received laser beam has been conceived as a means of reducing the deleterious effects of noise and atmospheric turbulence in free-space optical communication using focal-plane detector array technologies. In comparison with a receiver based on direct detection of the intensity modulation of a PPM signal, a receiver based on the present method of coherent detection performs well at much higher background levels. In principle, the coherent-detection receiver can exhibit quantum-limited performance despite atmospheric turbulence. The key components of such a receiver include standard receiver optics, a laser that serves as a local oscillator, a focal-plane array of photodetectors, and a signal-processing and data-acquisition assembly needed to sample the focal-plane fields and reconstruct the pulsed signal prior to detection. The received PPM-modulated laser beam and the local-oscillator beam are focused onto the photodetector array, where they are mixed in the detection process. The two lasers are of the same or nearly the same frequency. If the two lasers are of different frequencies, then the coherent detection process is characterized as heterodyne and, using traditional heterodyne-detection terminology, the difference between the two laser frequencies is denoted the intermediate frequency (IF). If the two laser beams are of the same frequency and remain aligned in phase, then the coherent detection process is characterized as homodyne (essentially, heterodyne detection at zero IF). As a result of the inherent squaring operation of each photodetector, the output current includes an IF component that contains the signal modulation. The amplitude of the IF component is proportional to the product of the local-oscillator signal amplitude and the PPM signal amplitude. Hence, by using a sufficiently strong local-oscillator signal, one can make the PPM-modulated IF signal strong enough to overcome thermal noise in the receiver circuits: this is what makes it possible to achieve near-quantum-limited detection in the presence of strong background. Following quantum-limited coherent detection, the outputs of the individual photodetectors are automatically aligned in phase by use of one or more adaptive array compensation algorithms [e.g., the least-mean-square (LMS) algorithm]. Then the outputs are combined and the resulting signal is processed to extract the high-rate information, as though the PPM signal were received by a single photodetector. In a continuing series of experiments to test this method (see Fig. 1), the local oscillator has a wavelength of 1,064 nm, and another laser is used as a signal transmitter at a slightly different wavelength to establish an IF of about 6 MHz. There are 16 photodetectors in a 4 4 focal-plane array; the detector outputs are digitized at a sampling rate of 25 MHz, and the signals in digital form are combined by use of the LMS algorithm. Convergence of the adaptive combining algorithm in the presence of simulated atmospheric turbulence for optical PPM signals has already been demonstrated in the laboratory; the combined output is shown in Fig. 2(a), and Fig. 2(b) shows the behavior of the phase of the combining weights as a function of time (or samples). We observe that the phase of the weights has a sawtooth shape due to the continuously changing phase in the down-converted output, which is not exactly at zero frequency. Detailed performance analysis of this coherent free-space optical communication system in the presence of simulated atmospheric turbulence is currently under way.

Vilnrotter, Victor↗

Parallel Processing of Broad-Band PPM Signals

A parallel-processing algorithm and a hardware architecture to implement the algorithm have been devised for timeslot synchronization in the reception of pulse-position-modulated (PPM) optical or radio signals. As in the cases of some prior algorithms and architectures for parallel, discrete-time, digital processing of signals other than PPM, an incoming broadband signal is divided into multiple parallel narrower-band signals by means of sub-sampling and filtering. The number of parallel streams is chosen so that the frequency content of the narrower-band signals is low enough to enable processing by relatively-low speed complementary metal oxide semiconductor (CMOS) electronic circuitry. The algorithm and architecture are intended to satisfy requirements for time-varying time-slot synchronization and post-detection filtering, with correction of timing errors independent of estimation of timing errors. They are also intended to afford flexibility for dynamic reconfiguration and upgrading. The architecture is implemented in a reconfigurable CMOS processor in the form of a field-programmable gate array. The algorithm and its hardware implementation incorporate three separate time-varying filter banks for three distinct functions: correction of sub-sample timing errors, post-detection filtering, and post-detection estimation of timing errors. The design of the filter bank for correction of timing errors, the method of estimating timing errors, and the design of a feedback-loop filter are governed by a host of parameters, the most critical one, with regard to processing very broadband signals with CMOS hardware, being the number of parallel streams (equivalently, the rate-reduction parameter).

Gray, Andrew↗

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method 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. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗

A fast adaptive convex hull algorithm on two-dimensional processor arrays with a reconfigurable BUS system

A bus system that can change dynamically to suit computational needs is referred to as reconfigurable. We present a fast adaptive convex hull algorithm on a two-dimensional processor array with a reconfigurable bus system (2-D PARBS, for short). Specifically, we show that computing the convex hull of a planar set of n points taken O(log n/log m) time on a 2-D PARBS of size mn x n with 3 less than or equal to m less than or equal to n. Our result implies that the convex hull of n points in the plane can be computed in O(1) time in a 2-D PARBS of size n(exp 1.5) x n.

Olariu, S.↗

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.↗

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↗

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.↗

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.↗

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↗

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↗

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.↗

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.↗

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↗