Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using a multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area.

Shao, H. M.↗
NASA NTRS1988

On the VLSI design of a pipeline Reed-Solomon decoder using systolic arrays

A new very large scale integration (VLSI) design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorporated with little additional complexity. By using multiplexing technique, a new implementation of Euclid's algorithm maintains the throughput rate with less circuitry. Such improvements result in both enhanced capability and significant reduction in silicon area.

Shao, Howard M.↗
NASA NTRS2018

Remaining Flying Time Prediction Implementing Battery Prognostics Framework for Electric UAV's

In this paper the problem of building trust in the online safety prediction of an fixed wing small electric unmanned aerial vehicles (e-UAV) for remaining flying time is addressed. A series of flight tests are described to verify the performance of the remaining flying time prediction algorithm. The estimate of remaining flying time is used to activate an alarm when the predicted remaining time falls below a threshold of two minutes. This updates the pilot to transition to the landing sequence of the flight profile. A second alarm is activated when the battery state of charge (SOC) falls below a specified safety limit threshold. This SOC threshold is the point at which the battery energy reserve would no longer safely support enough aborted landing attempts. During the test flights, the motor system is operated with the same predefined timed airspeed profile for each test. To test the robustness of the developed prediction algorithm, partial tests were performed with and remaining were performed without a simulated power train fault. To simulate a partial power train fault in the e-UAV the pilot engages a resistor bank at a specified time during the test flight. The flying time prediction system is agnostic of the pilot's activation of the fault and must adapt to the vehicle's state. The time at which the limit threshold on battery SOC is reached, it is then used to measure the accuracy of the remaining flying time predictions. This is demonstrated through comparing results from two battery models being developed. Accuracy requirements for the alarms are considered and the results discussed.

Kulkarni, Chetan↗
NASA NTRS2010

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki↗
NASA NTRS1988

Flight demonstration of redundancy management algorithms for a skewed array of inertial sensors

Flight test results for two fault-tolerance algorithms developed for a redundant strapdown inertial measurement unit consisting of four 2-DOF gyros and accelerometers mounted on the faces of a semioctahedron are presented. Although both algorithms provided timely detection and isolation of flight control level failures, the generalized likelihood test algorithm provided more timely detection and isolation of low-level sensor failures than the edge vector test algorithm. The generalized likelihood test produced a false isolation for the case of a dual low-level failure applied to the sensitive axes of an accelerometer. Both of the algorithms were shown to provide dual fail-operational performance for the skewed array of inertial sensors.

Morrell, F. R.↗
NASA NTRS1990

Flight test results of failure detection and isolation algorithms for a redundant strapdown inertial measurement unit

Flight test results for two sensor fault-tolerant algorithms developed for a redundant strapdown inertial measurement unit are presented. The inertial measurement unit (IMU) consists of four two-degrees-of-freedom gyros and accelerometers mounted on the faces of a semi-octahedron. Fault tolerance is provided by edge vector test and generalized likelihood test algorithms, each of which can provide dual fail-operational capability for the IMU. To detect the wide range of failure magnitudes in inertial sensors, which provide flight crucial information for flight control and navigation, failure detection and isolation are developed in terms of a multi level structure. Threshold compensation techniques, developed to enhance the sensitivity of the failure detection process to navigation level failures, are presented. Four flight tests were conducted in a commercial transport-type environment to compare and determine the performance of the failure detection and isolation methods. Dual flight processors enabled concurrent tests for the algorithms. Failure signals such as hard-over, null, or bias shift, were added to the sensor outputs as simple or multiple failures during the flights. Both algorithms provided timely detection and isolation of flight control level failures. The generalized likelihood test algorithm provided more timely detection of low-level sensor failures, but it produced one false isolation. Both algorithms demonstrated the capability to provide dual fail-operational performance for the skewed array of inertial sensors.

Morrell, F. R.↗
NASA NTRS1989

DYSCO: A software system for modeling general dynamic systems

The DYSCO program has been under development since 1979. It has been funded by Army and Air Force laboratories and by the Kaman Aerospace Corporation. It is presently available at a number of government and nongovernment installations. It has been used to analyze a very broad range of dynamics problems. A principle feature of the software design of DYSCO is the separation of the executive from the technology. The executive, which controls all the operations, is intelligent in the sense that it knows that its function is to assemble differential equations and to prepare them for solution. The technology library contains FORTRAN routines which perform standard functions, such as, computing the equation coefficients of an element (or component) given the local state at any time. The technology library also contains algorithms and procedures for solving the coupled system equations. The system was designed to allow easy additional of technology to the library. Any linear or nonlinear structural entity, control system, or set of ordinary differential equations may be simply coded and added to the library, as well as algorithms for time or frequency domain solution. The program is described with emphasis on its usefulness in easily modeling unusual concepts and configurations, performing analysis of damage, evaluating new algorithms, and simulating dynamic tests.

Berman, Alex↗
NASA NTRS1996

Ideas for Future GPS Timing Improvements

Having recently met stringent criteria for full operational capability (FOC) certification, the Global Positioning System (GPS) now has higher customer expectations than ever before. In order to maintain customer satisfaction, and the meet the even high customer demands of the future, the GPS Master Control Station (MCS) must play a critical role in the process of carefully refining the performance and integrity of the GPS constellation, particularly in the area of timing. This paper will present an operational perspective on several ideas for improving timing in GPS. These ideas include the desire for improving MCS - US Naval Observatory (USNO) data connectivity, an improved GPS-Coordinated Universal Time (UTC) prediction algorithm, a more robust Kalman Filter, and more features in the GPS reference time algorithm (the GPS composite clock), including frequency step resolution, a more explicit use of the basic time scale equation, and dynamic clock weighting. Current MCS software meets the exceptional challenge of managing an extremely complex constellation of 24 navigation satellites. The GPS community will, however, always seek to improve upon this performance and integrity.

Hutsell, Steven T.↗
NASA NTRS1985

Piloted simulation of an algorithm for onboard control of time-optimal intercept

A piloted simulation of algorithms for onboard computation of trajectories for time-optimal intercept of a moving target by an F-8 aircraft is described. The algorithms, use singular perturbation techniques, generate commands in the cockpit. By centering the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. Example simulations are shown and statistical data on the pilot's performance when presented with different display and computation modes are described.

Price, D. B.↗
NASA NTRS1987

Computer architecture for efficient algorithmic executions in real-time systems: New technology for avionics systems and advanced space vehicles

Improvements and advances in the development of computer architecture now provide innovative technology for the recasting of traditional sequential solutions into high-performance, low-cost, parallel system to increase system performance. Research conducted in development of specialized computer architecture for the algorithmic execution of an avionics system, guidance and control problem in real time is described. A comprehensive treatment of both the hardware and software structures of a customized computer which performs real-time computation of guidance commands with updated estimates of target motion and time-to-go is presented. An optimal, real-time allocation algorithm was developed which maps the algorithmic tasks onto the processing elements. This allocation is based on the critical path analysis. The final stage is the design and development of the hardware structures suitable for the efficient execution of the allocated task graph. The processing element is designed for rapid execution of the allocated tasks. Fault tolerance is a key feature of the overall architecture. Parallel numerical integration techniques, tasks definitions, and allocation algorithms are discussed. The parallel implementation is analytically verified and the experimental results are presented. The design of the data-driven computer architecture, customized for the execution of the particular algorithm, is discussed.

Carroll, Chester C.↗
NASA NTRS1990

Processing of DMSP magnetic data: Handbook of programs, tapes, and datasets

The DMSP F-7 satellite was an operational Air Force meteorological satellite which carried a magnetometer for geophysical measurements. The magnetometer was located within the body of the spacecraft in the presence of large spacecraft fields. In addition to stray magnetic fields, the data have inherent position and time inaccuracies. Algorithms were developed to identify and remove time varying magnetic field noise from the data. These algorithms are embodied in an automated procedure which fits a smooth curve through the data and then identifies outliers and which filters the predominant Fourier component of noise from the data. Techniques developed for Magsat were then modified and used to attempt determination of the spacecraft fields, of any rotation between the magnetometer axes and the spacecraft axes, and of any scale changes within the magnetometer itself. Software setup and usage are documented and program listings are included in the Appendix. The initial and resulting data are archived on magnetic cartridge and the formats are documented.

Langel, R. A.↗
NASA NTRS1985

On the impact of initially stressed composite laminates

The impact response behavior of initially stressed composite laminates is investigated using the finite element method. An experimentally established contact law is incorporated into the finite element program. The Newmark time integration algorithm is used for solving the time dependent equations of the plate and the impactor. Numerical results, including the contact force history, deflection, and strain in the plate, are presented. Effects of impact velocity, initial stress, and the mass and size of the impactor are discussed.

Sun, C. T.↗
NASA NTRS1988

Some experiences with the Eigensystem Realization Algorithm

The Eigensystem Realization Algorithm (ERA) is a multiinput/multioutput time-domain algorithm for minimum-order system realization and modal parameter identification. It has been used for structural dynamics data analysis at the Langley Research Center for several years. Some of the practical experiences encountered in these projects are discussed in this paper. Three examples are used: the Galileo spacecraft, the Solar Array Flight Experiment, and a laboratory space-truss model. Several techniques for assessing identification accuracy are illustrated.

Pappa, Richard S.↗
NASA NTRS1991

Transonic adaptive flutter suppression using approximate unsteady time domain aerodynamics

A digital adaptive controller is applied to the active flutter suppression problem of a wing under time varying flight conditions in subsonic and transonic flow. Linear quadratic controller gain at each time step is obtained using an iterative Riccati solver. The digital adaptive optimal controller is robust with respect to the unknown external loads. Flutter and divergence instabilities are simultaneously suppressed using a trailing-edge control surface and displacement sensing. A new transonic unsteady aerodynamic approximation methodology is developed which enables one to carry out the rapid calculation required for transonic aeroservoelastic applications. This approximation is based on a combination of unsteady subsonic aerodynamics combined with a transonic correction procedure. Aeroservoelastic transient time response is obtained using Roger's approximation, state transition matrices and an iterative time marching algorithm. The aeroservoelastic system in the time domain is modeled using a deterministic ARMA model together with a parameter estimator. Transonic flutter boundaries of a wing structure are computed, in the time domain, using an estimated aeroelastic system matrix and are in good agreement with experimental data for the low transonic Mach number range.

Pak, Chan-Gi↗
NASA NTRS1993

High performance MPEG-audio decoder IC

The emerging digital audio and video compression technology brings both an opportunity and a new challenge to IC design. The pervasive application of compression technology to consumer electronics will require high volume, low cost IC's and fast time to market of the prototypes and production units. At the same time, the algorithms used in the compression technology result in complex VLSI IC's. The conflicting challenges of algorithm complexity, low cost, and fast time to market have an impact on device architecture and design methodology. The work presented in this paper is about the design of a dedicated, high precision, Motion Picture Expert Group (MPEG) audio decoder.

Thorn, M.↗
NASA NTRS2010

Space Network Time Distribution and Synchronization Protocol Development for Mars Proximity Link

Time distribution and synchronization in deep space network are challenging due to long propagation delays, spacecraft movements, and relativistic effects. Further, the Network Time Protocol (NTP) designed for terrestrial networks may not work properly in space. In this work, we consider the time distribution protocol based on time message exchanges similar to Network Time Protocol (NTP). We present the Proximity-1 Space Link Interleaved Time Synchronization (PITS) algorithm that can work with the CCSDS Proximity-1 Space Data Link Protocol. The PITS algorithm provides faster time synchronization via two-way time transfer over proximity links, improves scalability as the number of spacecraft increase, lowers storage space requirement for collecting time samples, and is robust against packet loss and duplication which underlying protocol mechanisms provide.

In Situ Time Distribution↗
NASA NTRS2017

Flight Tests of a Remaining Flying Time Prediction System for Small Electric Aircraft in the Presence of Faults

This paper addresses the problem of building trust in the online prediction of a battery powered aircraft's remaining flying time. A series of flight tests is described that make use of a small electric powered unmanned aerial vehicle (eUAV) to verify the performance of the remaining flying time prediction algorithm. The estimate of remaining flying time is used to activate an alarm when the predicted remaining time is two minutes. This notifies the pilot to transition to the landing phase of the flight. A second alarm is activated when the battery charge falls below a specified limit threshold. This threshold is the point at which the battery energy reserve would no longer safely support two repeated aborted landing attempts. During the test series, the motor system is operated with the same predefined timed airspeed profile for each test. To test the robustness of the prediction, half of the tests were performed with, and half were performed without, a simulated powertrain fault. The pilot remotely engages a resistor bank at a specified time during the test flight to simulate a partial powertrain fault. The flying time prediction system is agnostic of the pilot's activation of the fault and must adapt to the vehicle's state. The time at which the limit threshold on battery charge is reached is then used to measure the accuracy of the remaining flying time predictions. Accuracy requirements for the alarms are considered and the results discussed.

Hogge, Edward F.↗
NASA NTRS1978

Finite element concepts in computational aerodynamics

Finite element theory was employed to establish an implicit numerical solution algorithm for the time averaged unsteady Navier-Stokes equations. Both the multidimensional and a time-split form of the algorithm were considered, the latter of particular interest for problem specification on a regular mesh. A Newton matrix iteration procedure is outlined for solving the resultant nonlinear algebraic equation systems. Multidimensional discretization procedures are discussed with emphasis on automated generation of specific nonuniform solution grids and accounting of curved surfaces. The time-split algorithm was evaluated with regards to accuracy and convergence properties for hyperbolic equations on rectangular coordinates. An overall assessment of the viability of the finite element concept for computational aerodynamics is made.

Baker, A. J.↗