Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,045 records · Page 58

An algorithm to design a multiple-channel communications system

The authors present a novel algorithm to design a phase-modulated residual carrier communications system for optimum performance. The algorithm has been developed as an aid in the design of two telemetry data channels operating simultaneously with a turn-around ranging signal. The algorithm provides the selection of an optimum subcarrier frequency and modulation indices for minimizing the mutual interferences among the channels to achieve desired link performance margins. The set of modulation indices provided by this algorithm will also achieve an optimum power division between the carrier, the ranging and the high data rate and low data rate channels. Finally, a software program using this algorithm has been developed for use with personal computers. This program provides the computation of the optimum subcarrier frequencies and modulation indices for a standard case that is recommended by the international Consultative Committee for Space Data Systems.

Nguyen, Tien M.↗

Near-nadir microwave specular returns from the sea surface - Altimeter algorithms for wind and wind stress

Two approaches have been adopted to construct altimeter wind algorithms: one is based on the mean-square sea surface slope, and the other is based on the Seasat scatterometer wind. Both types of algorithms are critically reviewed with respect to the mechanism governing near-nadir sea returns and the comparison between altimeter and buoy winds. A new algorithm is proposed; it is deduced on the basis of microwave specular reflection and is finely tuned with buoy-measured winds. On the basis of this algorithm and the formula of the wind-stress coefficient, a simple wind-stress algorithm is also proposed.

Wu, Jin↗

Flux-difference split parabolized Navier-Stokes algorithm for non-equilibrium chemically reacting flows

A flux-difference split explicit finite-difference algorithm is presented for solving the parabolized form of the equations governing three-dimensional nonequilibrium chemically reacting flows. The algorithm is based on an explicit noniterative, upwind space-marching scheme developed by Korte, but differs in that the unsteady Riemann problem, rather than the steady Riemann problem, is solved. The algorithm allows either a second or an approximately third-order accurate upwind treatment of the convection terms by employing the unsteady approximate Riemann solver of Roe. The source terms of the species transport equations are treated in either an explicit or implicit manner, and the species diffusion terms are modeled with either a Fickian or a multicomponent model. A validation of the algorithm is performed by comparing computational results with the 2-D Mach 14, 15 degree compression-corner data of Holden. The three-dimensional capability of the algorithm is demonstrated by computing Mach 2.7 flow over a swept wedge scramjet fuel injector, and three-dimensional reacting flow capability is demonstrated by a computing a shock-jet interaction concept for mixing and combustion enhancement.

White, J. A.↗

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗

Nonlinear smoothing identification algorithm with application to data consistency checks

A parameter identification algorithm for nonlinear systems is presented. It is based on smoothing test data with successively improved sets of model parameters. The smoothing, which is iterative, provides all of the information needed to compute the gradients of the smoothing performance measure with respect to the parameters. The parameters are updated using a quasi-Newton procedure, until convergence is achieved. The advantage of this algorithm over standard maximum likelihood identification algorithms is the computational savings in calculating the gradient. This algorithm was used for flight-test data consistency checks based on a nonlinear model of aircraft kinematics. Measurement biases and scale factors were identified. The advantages of the presented algorithm and model are discussed.

Idan, M.↗

Efficient demultiplexing algorithm for noncontiguous carriers

A channel separation algorithm for the frequency division multiple access/time division multiplexing (FDMA/TDM) scheme is presented. It is shown that implementation using this algorithm can be more effective than the fast Fourier transform (FFT) algorithm when only a small number of carriers need to be selected from many, such as satellite Earth terminals. The algorithm is based on polyphase filtering followed by application of a generalized Walsh-Hadamard transform (GWHT). Comparison of the transform technique used in this algorithm with discrete Fourier transform (DFT) and FFT is given. Estimates of the computational rates and power requirements to implement this system are also given.

Thanawala, A. A.↗

Phase-retrieval algorithms for a complicated optical system

Phase-retrieval algorithms have been developed that handle a complicated optical system that requires multiple Fresnellike transforms to propagate from one end of the system to the other including the absorption by apertures in more than one plane and allowance for bad detector pixels. Gradient-search algorithms and generalizations of the iterative-transform phase-retrieval algorithms are derived. Analytic expressions for the gradient of an error metric, with respect to polynomial coefficients and with respect to point-by-point phase descriptions, are given. The entire gradient can be computed with the number of transforms required to propagate a wave front from one end of the optical system to the other and back again, independent of the number of coefficients or phase points. This greatly speeds the computation. The reconstruction of pupil amplitude is also given. A convergence proof of the generalized iterative transform algorithm is given. These improved algorithms permit a more accurate characterization of complicated optical systems from their point spread functions.

Fienup, J. R.↗

Time scale algorithms for an inhomogeneous group of atomic clocks

Through the past 17 years, the time scale requirements at the National Research Council (NRC) have been met by the unsteered output of its primary laboratory cesium clocks, supplemented by hydrogen masers when short-term stability better than 2 x 10(exp -12)tau(sup -1/2) has been required. NRC now operates three primary laboratory cesium clocks, three hydrogen masers, and two commercial cesium clocks. NRC has been using ensemble averages for internal purposes for the past several years, and has a realtime algorithm operating on the outputs of its high-resolution (2 x 10(exp -13) s at 1 s) phase comparators. The slow frequency drift of the hydrogen masers has presented difficulties in incorporating their short-term stability into the ensemble average, while retaining the long-term stability of the laboratory cesium frequency standards. We report on this work on algorithms for an inhomogeneous ensemble of atomic clocks, and on our initial work on time scale algorithms that could incorporate frequency calibrations at NRC from the next generation of Zacharias fountain cesium frequency standards having frequency accuracies that might surpass 10(exp -15), or from single-trapped-ion frequency standards (Ba+, Sr+,...) with even higher potential accuracies. The requirements for redundancy in all the elements (including the algorithms) of an inhomogeneous ensemble that would give a robust real-time output of the algorithms are presented and discussed.

Jacques, C.↗

Feature extraction and classification algorithms for high dimensional data

Feature extraction and classification algorithms for high dimensional data are investigated. Developments with regard to sensors for Earth observation are moving in the direction of providing much higher dimensional multispectral imagery than is now possible. In analyzing such high dimensional data, processing time becomes an important factor. With large increases in dimensionality and the number of classes, processing time will increase significantly. To address this problem, a multistage classification scheme is proposed which reduces the processing time substantially by eliminating unlikely classes from further consideration at each stage. Several truncation criteria are developed and the relationship between thresholds and the error caused by the truncation is investigated. Next an approach to feature extraction for classification is proposed based directly on the decision boundaries. It is shown that all the features needed for classification can be extracted from decision boundaries. A characteristic of the proposed method arises by noting that only a portion of the decision boundary is effective in discriminating between classes, and the concept of the effective decision boundary is introduced. The proposed feature extraction algorithm has several desirable properties: it predicts the minimum number of features necessary to achieve the same classification accuracy as in the original space for a given pattern recognition problem; and it finds the necessary feature vectors. The proposed algorithm does not deteriorate under the circumstances of equal means or equal covariances as some previous algorithms do. In addition, the decision boundary feature extraction algorithm can be used both for parametric and non-parametric classifiers. Finally, some problems encountered in analyzing high dimensional data are studied and possible solutions are proposed. First, the increased importance of the second order statistics in analyzing high dimensional data is recognized. By investigating the characteristics of high dimensional data, the reason why the second order statistics must be taken into account in high dimensional data is suggested. Recognizing the importance of the second order statistics, there is a need to represent the second order statistics. A method to visualize statistics using a color code is proposed. By representing statistics using color coding, one can easily extract and compare the first and the second statistics.

Lee, Chulhee↗

Control algorithm implementation for a redundant degree of freedom manipulator

This project's purpose is to develop and implement control algorithms for a kinematically redundant robotic manipulator. The manipulator is being developed concurrently by Odetics Inc., under internal research and development funding. This SBIR contract supports algorithm conception, development, and simulation, as well as software implementation and integration with the manipulator hardware. The Odetics Dexterous Manipulator is a lightweight, high strength, modular manipulator being developed for space and commercial applications. It has seven fully active degrees of freedom, is electrically powered, and is fully operational in 1 G. The manipulator consists of five self-contained modules. These modules join via simple quick-disconnect couplings and self-mating connectors which allow rapid assembly/disassembly for reconfiguration, transport, or servicing. Each joint incorporates a unique drive train design which provides zero backlash operation, is insensitive to wear, and is single fault tolerant to motor or servo amplifier failure. The sensing system is also designed to be single fault tolerant. Although the initial prototype is not space qualified, the design is well-suited to meeting space qualification requirements. The control algorithm design approach is to develop a hierarchical system with well defined access and interfaces at each level. The high level endpoint/configuration control algorithm transforms manipulator endpoint position/orientation commands to joint angle commands, providing task space motion. At the same time, the kinematic redundancy is resolved by controlling the configuration (pose) of the manipulator, using several different optimizing criteria. The center level of the hierarchy servos the joints to their commanded trajectories using both linear feedback and model-based nonlinear control techniques. The lowest control level uses sensed joint torque to close torque servo loops, with the goal of improving the manipulator dynamic behavior. The control algorithms are subjected to a dynamic simulation before implementation.

Cohan, Steve↗

Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems

Systems of linear equations with Toeplitz coefficient matrices arise in many important applications. The classical Levinson algorithm computes solutions of Toeplitz systems with only O(n(sub 2)) arithmetic operations, as compared to O(n(sub 3)) operations that are needed for solving general linear systems. However, the Levinson algorithm in its original form requires that all leading principal submatrices are nonsingular. An extension of the Levinson algorithm to general Toeplitz systems is presented. The algorithm uses look-ahead to skip over exactly singular, as well as ill-conditioned leading submatrices, and, at the same time, it still fully exploits the Toeplitz structure. In our derivation of this algorithm, we make use of the intimate connection of Toeplitz matrices with formally biorthogonal polynomials.

Freund, Roland W.↗

Accuracy metrics for judging time scale algorithms

Time scales have been constructed in different ways to meet the many demands placed upon them for time accuracy, frequency accuracy, long-term stability, and robustness. Usually, no single time scale is optimum for all purposes. In the context of the impending availability of high-accuracy intermittently-operated cesium fountains, we reconsider the question of evaluating the accuracy of time scales which use an algorithm to span interruptions of the primary standard. We consider a broad class of calibration algorithms that can be evaluated and compared quantitatively for their accuracy in the presence of frequency drift and a full noise model (a mixture of white PM, flicker PM, white FM, flicker FM, and random walk FM noise). We present the analytic techniques for computing the standard uncertainty for the full noise model and this class of calibration algorithms. The simplest algorithm is evaluated to find the average-frequency uncertainty arising from the noise of the cesium fountain's local oscillator and from the noise of a hydrogen maser transfer-standard. This algorithm and known noise sources are shown to permit interlaboratory frequency transfer with a standard uncertainty of less than 10(exp -15) for periods of 30-100 days.

Douglas, R. J.↗

MODIS. Volume 2: MODIS level 1 geolocation, characterization and calibration algorithm theoretical basis document, version 1

The EOS Moderate Resolution Imaging Spectrometer (MODIS) is being developed by NASA for flight on the Earth Observing System (EOS) series of satellites, the first of which (EOS-AM-1) is scheduled for launch in 1998. This document describes the algorithms and their theoretical basis for the MODIS Level 1B characterization, calibration, and geolocation algorithms which must produce radiometrically, spectrally, and spatially calibrated data with sufficient accuracy so that Global change research programs can detect minute changes in biogeophysical parameters. The document first describes the geolocation algorithm which determines geodetic latitude, longitude, and elevation of each MODIS pixel and the determination of geometric parameters for each observation (satellite zenith angle, satellite azimuth, range to the satellite, solar zenith angle, and solar azimuth). Next, the utilization of the MODIS onboard calibration sources, which consist of the Spectroradiometric Calibration Assembly (SRCA), Solar Diffuser (SD), Solar Diffuser Stability Monitor (SDSM), and the Blackbody (BB), is treated. Characterization of these sources and integration of measurements into the calibration process is described. Finally, the use of external sources, including the Moon, instrumented sites on the Earth (called vicarious calibration), and unsupervised normalization sites having invariant reflectance and emissive properties is treated. Finally, algorithms for generating utility masks needed for scene-based calibration are discussed. Eight appendices are provided, covering instrument design and additional algorithm details.

Barker, John L.↗

A new algorithm for attitude-independent magnetometer calibration

A new algorithm is developed for inflight magnetometer bias determination without knowledge of the attitude. This algorithm combines the fast convergence of a heuristic algorithm currently in use with the correct treatment of the statistics and without discarding data. The algorithm performance is examined using simulated data and compared with previous algorithms.

Alonso, Roberto↗

The gust-front detection and wind-shift algorithms for the Terminal Doppler Weather Radar system

The Federal Aviation Administration's (FAA) Terminal Doppler Weather Radar (TDWR) system was primarily designed to address the operational needs of pilots in the avoidance of low-altitude wind shears upon takeoff and landing at airports. One of the primary methods of wind-shear detection for the TDWR system is the gust-front detection algorithm. The algorithm is designed to detect gust fronts that produce a wind-shear hazard and/or sustained wind shifts. It serves the hazard warning function by providing an estimate of the wind-speed gain for aircraft penetrating the gust front. The gust-front detection and wind-shift algorithms together serve a planning function by providing forecasted gust-front locations and estimates of the horizontal wind vector behind the front, respectively. This information is used by air traffic managers to determine arrival and departure runway configurations and aircraft movements to minimize the impact of wind shifts on airport capacity. This paper describes the gust-front detection and wind-shift algorithms to be fielded in the initial TDWR systems. Results of a quantitative performance evaluation using Doppler radar data collected during TDWR operational demonstrations at the Denver, Kansas City, and Orlando airports are presented. The algorithms were found to be operationally useful by the FAA airport controllers and supervisors.

Hermes, Laurie G.↗

On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains

Recently the Multi-Level algorithm was introduced as a general purpose solver for the solution of steady state Markov chains. In this paper, we consider the performance of the Multi-Level algorithm for solving Nearly Completely Decomposable (NCD) Markov chains, for which special-purpose iteractive aggregation/disaggregation algorithms such as the Koury-McAllister-Stewart (KMS) method have been developed that can exploit the decomposability of the the Markov chain. We present experimental results indicating that the general-purpose Multi-Level algorithm is competitive, and can be significantly faster than the special-purpose KMS algorithm when Gauss-Seidel and Gaussian Elimination are used for solving the individual blocks.

Leutenegger, Scott T.↗

A new algorithm for five-hole probe calibration, data reduction, and uncertainty analysis

A new algorithm for five-hole probe calibration and data reduction using a non-nulling method is developed. The significant features of the algorithm are: (1) two components of the unit vector in the flow direction replace pitch and yaw angles as flow direction variables; and (2) symmetry rules are developed that greatly simplify Taylor's series representations of the calibration data. In data reduction, four pressure coefficients allow total pressure, static pressure, and flow direction to be calculated directly. The new algorithm's simplicity permits an analytical treatment of the propagation of uncertainty in five-hole probe measurement. The objectives of the uncertainty analysis are to quantify uncertainty of five-hole results (e.g., total pressure, static pressure, and flow direction) and determine the dependence of the result uncertainty on the uncertainty of all underlying experimental and calibration measurands. This study outlines a general procedure that other researchers may use to determine five-hole probe result uncertainty and provides guidance to improve measurement technique. The new algorithm is applied to calibrate and reduce data from a rake of five-hole probes. Here, ten individual probes are mounted on a single probe shaft and used simultaneously. Use of this probe is made practical by the simplicity afforded by this algorithm.

Reichert, Bruce A.↗

An algorithm for extraction of periodic signals from sparse, irregularly sampled data

Temporal gaps in discrete sampling sequences produce spurious Fourier components at the intermodulation frequencies of an oscillatory signal and the temporal gaps, thus significantly complicating spectral analysis of such sparsely sampled data. A new fast Fourier transform (FFT)-based algorithm has been developed, suitable for spectral analysis of sparsely sampled data with a relatively small number of oscillatory components buried in background noise. The algorithm's principal idea has its origin in the so-called 'clean' algorithm used to sharpen images of scenes corrupted by atmospheric and sensor aperture effects. It identifies as the signal's 'true' frequency that oscillatory component which, when passed through the same sampling sequence as the original data, produces a Fourier image that is the best match to the original Fourier space. The algorithm has generally met with succession trials with simulated data with a low signal-to-noise ratio, including those of a type similar to hourly residuals for Earth orientation parameters extracted from VLBI data. For eight oscillatory components in the diurnal and semidiurnal bands, all components with an amplitude-noise ratio greater than 0.2 were successfully extracted for all sequences and duty cycles (greater than 0.1) tested; the amplitude-noise ratios of the extracted signals were as low as 0.05 for high duty cycles and long sampling sequences. When, in addition to these high frequencies, strong low-frequency components are present in the data, the low-frequency components are generally eliminated first, by employing a version of the algorithm that searches for non-integer multiples of the discrete FET minimum frequency.

Wilcox, J. Z.↗