SEARCH · Search NASA
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.
A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.
Deadbeat control theory gives a feedback solution to the time optimal control of discrete time systems. Experience has shown the results to be impractical because they ignore bounds on the actuator strength. This paper develops two algorithms for generating time optimal control in feedback form for discrete systems with bounded controls. The results are also applicable for generating recovery regions and the set of reachable states. For multiple control problems a method of generating sublayers is developed which decreases off-line and on-line computational effort. Two algorithms are presented with somewhat different computational and storage requirements. The algorithms are practical within certain dimension constraints, and are natural for implementation with parallel processing.
The stray light contamination of the VIIRS Day-Night-Band (DNB) on-board the S-NPP satellite has been studied intensively. To alleviate its impact, a stray light correction look-up-table (LUT), which represents the stray light contamination, is derived from the new moon night dataset by subtracting the non stray light signal from the stray light affected signal. The derived LUT can be used to remove the majority of the contamination. However, the LUT remains static until the next update to the Level-1B data processing, usually one month later. Between these two updates, changes in the actual stray light are not captured. We present a method to derive a dynamic stray light correction LUT that covers the time period between updates. By analyzing the patterns in the annual stray light variation, a consistent trend was found in the LUT’s characteristic features which can be quantitatively expressed as time factors. These factors are then applied to the monthly LUT to produce a dynamic stray light LUT for any time of interest. The L1B software can use this algorithm to calculate the LUTs at the time of observation. The results show significant improvement in the DNB product compared to using the monthly static LUT. Furthermore, this time-dependent algorithm provides a basis for deriving a universal stray light correction LUT for VIIRS.
We present an outline of an algorithm to generate artificial helioseismic time-series, taking into account as much as possible of the knowledge we have on solar oscillations. The hope is that it will be possible to find the causes of some of the systematic errors in analysis algorithms by testing them with such artificial time-series.
Spectral factorization has been used previously to derive the steady-state solution of Kalman filtering equations without iteration for constant coefficient systems. The present work extends the spectral factorization algorithm to time-varying systems having periodic coefficient matrices for cases of both discrete and continuous systems. Time-consuming, expensive iterations of sequential covariance equations are not required to reach the final solution since this is an algebraic algorithm employing existing eigenvalue, eigenvector subroutines. The computer program incorporating the algorithm is suitable for sensitivity studies in formulating navigation and guidance strategies of low-thrust interplanetary missions. The determination of an optimum tracking pattern from an earth station is examined as an example.
An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.
This paper compares airspace design solutions for dynamically reconfiguring airspace in response to nominal daily traffic volume fluctuation. Airspace designs from seven algorithmic methods and a representation of current day operations in Kansas City Center were simulated with two times today's demand traffic. A three-configuration scenario was used to represent current day operations. Algorithms used projected unimpeded flight tracks to design initial 24-hour plans to switch between three configurations at predetermined reconfiguration times. At each reconfiguration time, algorithms used updated projected flight tracks to update the subsequent planned configurations. Compared to the baseline, most airspace design methods reduced delay and increased reconfiguration complexity, with similar traffic pattern complexity results. Design updates enabled several methods to as much as half the delay from their original designs. Freeform design methods reduced delay and increased reconfiguration complexity the most.
This paper compares airspace design solutions for dynamically reconfiguring airspace in response to nominal daily traffic volume fluctuation. Airspace designs from seven algorithmic methods and a representation of current day operations in Kansas City Center were simulated with two times today's demand traffic. A three-configuration scenario was used to represent current day operations. Algorithms used projected unimpeded flight tracks to design initial 24-hour plans to switch between three configurations at predetermined reconfiguration times. At each reconfiguration time, algorithms used updated projected flight tracks to update the subsequent planned configurations. Compared to the baseline, most airspace design methods reduced delay and increased reconfiguration complexity, with similar traffic pattern complexity results. Design updates enabled several methods to as much as half the delay from their original designs. Freeform design methods reduced delay and increased reconfiguration complexity the most.
Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.
This paper describes an algorithm for the scheduling of time-critical rendering and computation tasks on single- and multiple-processor architectures, with minimal pipelining. It was developed to manage scientific visualization scenes consisting of hundreds of objects, each of which can be computed and displayed at thousands of possible resolution levels. The algorithm generates the time-critical schedule using progressive-refinement techniques; it always returns a feasible schedule and, when allowed to run to completion, produces a near-optimal schedule which takes advantage of almost the entire multiple-processor system.
A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.
The design and evaluation of the Lightning Imaging Sensor Data Applications Display (LISDAD). The ultimate goal of the LISDAD system is to quantify the utility of total lightning information in short-term, severe-weather forecasting operations. To this end, scientists from NASA, NWS, and MIT organized an effort to study the relationship of lightning and severe-weather on a storm-by-storm, and even cell-by-cell basis for as many storms as possible near Melbourne, Florida. Melbourne was chosen as it offers a unique combination of high probability of severe weather and proximity to major relevant sensors - specifically: NASA's total lightning mapping system at Kennedy Space Center (the LDAR system at KSC); a NWS/NEXRAD radar (at Melbourne); and a prototype Integrated Terminal Weather System (ITWS, at Orlando), which obtains cloud-to-ground lightning Information from the National Lightning Detection Network (NLDN), and also uses NSSL's Severe Storm Algorithm (NSSL/SSAP) to obtain information about various storm-cell parameters. To assist in realizing this project's goal, an interactive, real-time data processing system (the LISDAD system) has been developed that supports both operational short-term weather forecasting and post facto severe-storm research. Suggestions have been drawn from the operational users (NWS/Melbourne) in the design of the data display and its salient behavior. The initial concept for the users Graphical Situation Display (GSD) was simply to overlay radar data with lightning data, but as the association between rapid upward trends in the total lightning rate and severe weather became evident, the display was significantly redesigned. The focus changed to support the display of time series of storm-parameter data and the automatic recognition of cells that display rapid changes in the total-lightning flash rate. The latter is calculated by grouping discrete LDAR radiation sources into lightning flashes using a time-space association algorithm. Specifically, the GSD presents the user with the Composite Maximum Reflectivity obtained from the NWS/NEXRAD. Superimposed upon this background image are placed small black circles indicating the locations of storm cells identified by the NSSL/SSA. The circles become cyan if lightning is detected within the storm-cell; if the cell has lightning rates indicative of a severe-storm, the circle turns red. This paper will: (1) review the design of LISDAD system; (2) present some examples of its data display; and shown results of the lightning based severe-weather prediction algorithm.
An efficient implementation of Generalized Predictive Control using a multi-layer feedforward neural network as the plant's nonlinear model is presented. In using Newton-Raphson as the optimization algorithm, the number of iterations needed for convergence is significantly reduced from other techniques. The main cost of the Newton-Raphson algorithm is in the calculation of the Hessian, but even with this overhead the low iteration numbers make Newton-Raphson faster than other techniques and a viable algorithm for real-time control. This paper presents a detailed derivation of the Neural Generalized Predictive Control algorithm with Newton-Raphson as the minimization algorithm. Simulation results show convergence to a good solution within two iterations and timing data show that real-time control is possible. Comments about the algorithm's implementation are also included.
The feasibility of real-time processing schemes using artificial neural networks (ANNs) is investigated. A rationale for digital neural nets is presented and a general processor architecture for control applications is illustrated. Research results on ANN structures for real-time applications are given. Research results on ANN algorithms for real-time control are also shown.
This article presents a projection algorithm based on the representation of radar samples as area elements, rather than point elements as traditionally done in previous works. Each area element in the geographic grid (geogrid) is associated with a set of samples in the radar grid that intersect completely or partially the area element according to the topography and the radar geometry. Accurate geocoding with adaptive multi-looking is achieved by successively assigning the weighted average of the radar samples to the corresponding geogrid elements. Analogously, the slant-range projection of geocoded data is improved by projecting the geogrid pixels onto the radar grid according to their projected area. When our slant-range projection approach is used within previously-published radiometric terrain correction (RTC) algorithms, the processing time is significantly reduced, performing 3.6 to 5.2 times faster over multi-looked data and up to 8.9 over single-look data. We demonstrate the strength of the area projection algorithm for RTC and geocoding using UAVSAR and Sentinel-1 data, and evaluate the results in the context of the upcoming NISAR mission.
The Real Time Display Builder (RTDB) is a prototype interactive graphics tool that builds logic-driven displays. These displays reflect current system status, implement fault detection algorithms in real time, and incorporate the operational knowledge of experienced flight controllers. RTDB utilizes an object-oriented approach that integrates the display symbols with the underlying operational logic. This approach allows the user to specify the screen layout and the driving logic as the display is being built. RTDB is being developed under UNIX in C utilizing the MASSCOMP graphics environment with appropriate functional separation to ease portability to other graphics environments. RTDB grew from the need to develop customized real-time data-driven Space Shuttle systems displays. One display, using initial functionality of the tool, was operational during the orbit phase of STS-26 Discovery. RTDB is being used to produce subsequent displays for the Real Time Data System project currently under development within the Mission Operations Directorate at NASA/JSC. The features of the tool, its current state of development, and its applications are discussed.
The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.
This paper introduces a general version of the information matrix consisting of the autocorrelation and cross-correlation matrices of the shifted input and output data. Based on the concept of data correlation, a new system realization algorithm is developed to create a model directly from input and output data. The algorithm starts by computing a special type of correlation matrix derived from the information matrix. The special correlation matrix provides information on the system-observability matrix and the state-vector correlation. A system model is then developed from the observability matrix in conjunction with other algebraic manipulations. This approach leads to several different algorithms for computing system matrices for use in representing the system model. The relationship of the new algorithms with other realization algorithms in the time and frequency domains is established with matrix factorization of the information matrix. Several examples are given to illustrate the validity and usefulness of these new algorithms.