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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Photon Counting Detector Array Algorithms for Deep Space Optical Communications

For deep-space optical communications systems utilizing an uplink optical beacon, a single-photon-counting detector array on the flight terminal can be used to simultaneously perform uplink tracking and communications as well as accurate downlink pointing at photon-starved (pW/sq. m) power levels. In this paper, we discuss concepts and algorithms for uplink signal acquisition, tracking, and parameter estimation using a photon-counting camera. Statistical models of detector output data and signal processing algorithms are presented, incorporating realistic effects such as Earth background and detector/readout blocking. Analysis and simulation results are validated against measured laboratory data using state-of-the-art commercial photon-counting detector arrays, demonstrating sub-microradian tracking errors under channel conditions representative of deep space optical links.

beacon tracking↗
NASA NTRS1976

Architecture and data processing alternatives for the TSE computer. Volume 3: Execution of a parallel counting algorithm using array logic (Tse) devices

A parallel algorithm for counting the number of logic-l elements in a binary array or image developed during preliminary investigation of the Tse concept is described. The counting algorithm is implemented using a basic combinational structure. Modifications which improve the efficiency of the basic structure are also presented. A programmable Tse computer structure is proposed, along with a hardware control unit, Tse instruction set, and software program for execution of the counting algorithm. Finally, a comparison is made between the different structures in terms of their more important characteristics.

Metcalfe, A. G.↗
NASA NTRS1983

Accuracy of measurement of star images on a pixel array

Algorithms are developed for predicting the accuracy with which the brightness of a star can be determined from its image on a digital detector array, as a function of the brightness of the background. The assumption is made that a known profile is being fitted by least squares. The two profiles used correspond to ST images and to ground-based observations. The first result is an approximate rule of thumb for equivalent noise area. More rigorous results are then given in tabular form. The size of the pixels, relative to the image size, is taken into account. Astronometric accuracy is also discussed briefly; the error, relative to image size, is very similar to the photometric error relative to brightness.

King, I. R.↗
NASA NTRS1988

A survey of the state-of-the-art and focused research in range systems

In this one-year renewal of NASA Contract No. 2-304, basic research, development, and implementation in the areas of modern estimation algorithms and digital communication systems have been performed. In the first area, basic study on the conversion of general classes of practical signal processing algorithms into systolic array algorithms is considered, producing four publications. Also studied were the finite word length effects and convergence rates of lattice algorithms, producing two publications. In the second area of study, the use of efficient importance sampling simulation technique for the evaluation of digital communication system performances were studied, producing two publications.

Kung, Yao↗
NASA NTRS1994

Arraying Techniques for the Galileo S-Band Mission, Part I - Full Spectrum Combining

It has been known for some time now that when signals from a single source are received at multiple antennas, these antennas can be arrayed to enhance the quality of the received signal. What has been relatively unknown, however, is that the quality of the combined signal critically depends on the arraying algorithm, as well as, the characteristics of the transmitted signal.

arraying algorithms↗
NASA NTRS1987

Array architectures for iterative algorithms

Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

Jagadish, Hosagrahar V.↗
NASA NTRS1986

Results in least-square estimation algorithms with systolic array architectures

It is proposed that the derivation of least-square algorithms for systolic array processing is best accomplished via a geometrical approach. This approach generates a set of vector equations from which a large number of new and previously known systolic arrays can be obtained in a unified manner. The paper presents and qualitatively describes these vector equations and shows how one such systolic array follows.

Kalson, S.↗
NASA NTRS1991

A class of least-squares filtering and identification algorithms with systolic array architectures

A unified approach is presented for deriving a large class of new and previously known time- and order-recursive least-squares algorithms with systolic array architectures, suitable for high-throughput-rate and VLSI implementations of space-time filtering and system identification problems. The geometrical derivation given is unique in that no assumption is made concerning the rank of the sample data correlation matrix. This method utilizes and extends the concept of oblique projections, as used previously in the derivations of the least-squares lattice algorithms. Exponentially weighted least-squares criteria are considered for both sliding and growing memory.

Kalson, Seth Z.↗
NASA NTRS1989

Systolic array processing of the sequential decoding algorithm

A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.

Chang, C. Y.↗
NASA NTRS1993

Tomographic decoding algorithm for a nonoverlapping redundant array

A tomographic reconstruction algorithm is developed for the nonoverlapping redundant array X-ray imaging system whereby the background contributions from out-of-focus planes can be eliminated. The algorithm makes use of two constraints derived from the physical characteristics of the nonoverlapping redundant array system in tandem with the correlation decoding process. It is simple, direct, and noniterative. Tomographic images of computer-generated planar and three-dimensional objects are provided to illustrate the effectiveness of the algorithm.

Yin, Lo I.↗
DOE OSTI2023

A Reproducible Validation of Algorithms for Estimating Array Tilt and Azimuth from Photovoltaic Power Time Series

In this research, we assess the viability of four different, publicly available algorithms for estimating the azimuth and tilt parameters of solar photovoltaic systems using only the associated AC power time series data and site latitude-longitude coordinates. In this work, we curated a benchmarking data set of 44 fixed-tilt systems, comprising 275 measured AC power inverter data streams, with known azimuth and tilt parameters. Additionally, we isolated test cases in the data set with real- world issues, including shading and clipping, to determine how algorithm performance varies based on the presence of these phenomena. Using this data set for benchmarking, we evaluated the estimated vs. actual system characteristics for each algorithm, as well as the associated algorithm execution time using a standardized benchmarking process. The two highest performing algorithms were the Solar Data Tools and the PVWatts 5- based methods, which both achieved a median absolute error of approximately 5 and 1 degrees for azimuth and tilt, respectively. During run time analysis, the SDT method was approximately 5 times faster than the PVWatts 5-based method, with the median execution time for a stream varying between 6 and 8 seconds vs. a median run time of 31 seconds for the PVWatts 5-based method.

azimuth↗
DOE OSTI2023

A Reproducible Validation of Algorithms for Estimating Array Tilt and Azimuth from Photovoltaic Power Time Series

In this research, we assess the viability of four different, publicly available algorithms for estimating the azimuth and tilt parameters of solar photovoltaic systems using only the associated AC power time series data and site latitude-longitude coordinates. In this work, we curated a benchmarking data set of 44 fixed-tilt systems, comprising 275 measured AC power inverter data streams, with known azimuth and tilt parameters. Additionally, we isolated test cases in the data set with real-world issues, including shading and clipping, to determine how algorithm performance varies based on the presence of these phenomena. Using this data set for benchmarking, we evaluated the estimated vs. actual system characteristics for each algorithm, as well as the associated algorithm execution time using a standardized benchmarking process. The two highest performing algorithms were the Solar Data Tools and the PVWatts 5-based methods, which both achieved a median absolute error of approximately 5 and 1 degrees for azimuth and tilt, respectively. During run time analysis, the SDT method was approximately 5 times faster than the PVWatts 5-based method, with the median execution time for a stream varying between 6 and 8 seconds vs. a median run time of 31 seconds for the PVWatts 5-based method.

algorithm validation↗
NASA NTRS2005

An Error Analysis of the Phased Array Antenna Pointing Algorithm for STARS Flight Demonstration No. 2

STARS is a multicenter NASA project to determine the feasibility of using space-based assets, such as the Tracking and Data Relay Satellite System (TDRSS) and Global Positioning System (GPS), to increase flexibility (e.g. increase the number of possible launch locations and manage simultaneous operations) and to reduce operational costs by decreasing the need for ground-based range assets and infrastructure. The STARS project includes two major systems: the Range Safety and Range User systems. The latter system uses broadband communications (125 kbps to 500 kbps) for voice, video, and vehicle/payload data. Flight Demonstration #1 revealed the need to increase the data rate of the Range User system. During Flight Demo #2, a Ku-band antenna will generate a higher data rate and will be designed with an embedded pointing algorithm to guarantee that the antenna is pointed directly at TDRS. This algorithm will utilize the onboard position and attitude data to point the antenna to TDRS within a 2-degree full-angle beamwidth. This report investigates how errors in aircraft position and attitude, along with errors in satellite position, propagate into the overall pointing vector.

Carney, Michael P.↗
NASA NTRS2003

Determining Direction of Arrival at a Y-Shaped Antenna Array

An algorithm computes the direction of arrival (both azimuth and elevation angles) of a lightning-induced electromagnetic signal from differences among the times of arrival of the signal at four antennas in a Y-shaped array on the ground. In the original intended application of the algorithm, the baselines of the array are about 90 m long and the array is part of a lightning-detection-and-ranging (LDAR) system. The algorithm and its underlying equations can also be used to compute directions of arrival of impulsive phenomena other than lightning on arrays of sensors other than radio antennas: for example, of an acoustic pulse arriving at an array of microphones.

Starr, Stan↗
NASA NTRS1988

Bidiagonalization and symmetric tridiagonalization by systolic arrays

A systolic algorithm and an array for bidiagonalization of an nxn matrix in O(nlog(2)n) time, using O(n to the 2nd power) cells are given. Bandedness of the input matrix may be effectively exploited. If the matrix is banded, with p nonzero subdiagonals and q nonzero superdiagonals, then 4nln(p + q) + O(n) clocks and 2n(p + q) + O((p + q) to the 2nd power + n) cells are needed. This is faster than the best previously reported result by the factor log(2)e = 1.44.... Moreover, in contrast to earlier systolic designs, which require the matrix to be preloaded into the array and the result matrix extracted after bidiagonalization, the present arrays are pipelined.

Schreiber, Robert↗
NASA NTRS1992

Classical and adaptive control algorithms for the solar array pointing system of the Space Station Freedom

Classical and adaptive control algorithms for the solar array pointing system of the Space Station Freedom are designed using a continuous rigid body model of the solar array gimbal assembly containing both linear and nonlinear dynamics due to various friction components. The robustness of the design solution is examined by performing a series of sensitivity analysis studies. Adaptive control strategies are examined in order to compensate for the unfavorable effect of static nonlinearities, such as dead-zone uncertainties.

Ianculescu, G. D.↗