SEARCH · Engineering Papers

Results for “adaptive algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64

All sources NASA NTRS DOE OSTI

NASA NTRS1997

Results of the Compensated Earth-Moon-Earth Retroreflector Laser Link (CEMERLL) Experiment

Adaptive optics techniques can be used to realize a robust low bit-error-rate link by mitigating the atmosphere-induced signal fades in optical communications links between ground-based transmitters and deep-space probes. Phase I of the Compensated Earth-Moon-Earth Retroreflector Laser Link (CEMERLL) experiment demonstrated the first propagation of an atmosphere-compensated laser beam to the lunar retroreflectors. A 1.06-micron Nd:YAG laser beam was propagated through the full aperture of the 1.5-m telescope at the Starfire Optical Range (SOR), Kirtland Air Force Base, New Mexico, to the Apollo 15 retroreflector array at Hadley Rille. Laser guide-star adaptive optics were used to compensate turbulence-induced aberrations across the transmitter's 1.5-m aperture. A 3.5-m telescope, also located at the SOR, was used as a receiver for detecting the return signals. JPL-supplied Chebyshev polynomials of the retroreflector locations were used to develop tracking algorithms for the telescopes. At times we observed in excess of 100 photons returned from a single pulse when the outgoing beam from the 1.5-m telescope was corrected by the adaptive optics system. No returns were detected when the outgoing beam was uncompensated. The experiment was conducted from March through September 1994, during the first or last quarter of the Moon.

Wilson, K. E.↗

NASA NTRS1993

A constrained joint source/channel coder design and vector quantization of nonstationary sources

The emergence of broadband ISDN as the network for the future brings with it the promise of integration of all proposed services in a flexible environment. In order to achieve this flexibility, asynchronous transfer mode (ATM) has been proposed as the transfer technique. During this period a study was conducted on the bridging of network transmission performance and video coding. The successful transmission of variable bit rate video over ATM networks relies on the interaction between the video coding algorithm and the ATM networks. Two aspects of networks that determine the efficiency of video transmission are the resource allocation algorithm and the congestion control algorithm. These are explained in this report. Vector quantization (VQ) is one of the more popular compression techniques to appear in the last twenty years. Numerous compression techniques, which incorporate VQ, have been proposed. While the LBG VQ provides excellent compression, there are also several drawbacks to the use of the LBG quantizers including search complexity and memory requirements, and a mismatch between the codebook and the inputs. The latter mainly stems from the fact that the VQ is generally designed for a specific rate and a specific class of inputs. In this work, an adaptive technique is proposed for vector quantization of images and video sequences. This technique is an extension of the recursively indexed scalar quantization (RISQ) algorithm.

Sayood, Khalid↗

NASA NTRS1986

Application of higher harmonic blade feathering on the OH-6A helicopter for vibration reduction

The design, implementation, and flight test results of higher harmonic blade feathering for vibration reduction on the OH-6A helicopter are described. The higher harmonic control (HHC) system superimposes fourth harmonic inputs upon the stationary swashplate. These inputs are transformed into 3P, 4P and 5P blade feathering angles. This results in modified blade loads and reduced fuselage vibrations. The primary elements of this adaptive vibration suppression system are: (1) acceleration transducers sensing the vibratory response of the fuselage; (2) a higher harmonic blade pitch actuator system; (3) a flightworthy microcomputer, incorporating the algorithm for reducing vibrations, and (4) a signal conditioning system, interfacing between the sensors, the microcomputer and the HHC actuators. The program consisted of three distinct phases. First, the HHC system was designed and implemented on the MDHC OH-6A helicopter. Then, the open loop, or manual controlled, flight tests were performed, and finally, the closed loop adaptive control system was tested. In 1983, one portion of the closed loop testing was performed, and in 1984, additional closed loop tests were conducted with improved software. With the HHC system engaged, the 4P pilot seat vibration levels were significantly lower than the baseline ON-6A levels. Moreover, the system did not adversely affect blade loads or helicopter performance. In conclusion, this successful proof of concept project demonstrated HHC to be a viable vibration suppression mechanism.

Straub, F. K.↗

NASA NTRS1986

Image data compression with vector quantization in the transform domain

In this paper, an algorithm is presented for image data compression based upon vector quantization of the two-dimensional discrete cosine transformed coefficients. The ac energies of the transformed blocks are used to classify them into eight different ac classes. The ac coefficients of the transformed blocks of class one are set to zero, while those of classes two through eight are transmitted by seven different code books. The dc coefficients of all eight classes are scalar quantized by an adaptive uniform quantizer. As a result, only 4.5 bits instead of eight bits are required to transmit the dc coefficient with negligible additional degradation. Overall, this algorithm requires approximately 0.75 bits per pixel and gives an average reconstruction error of 7.1.

Abdelwahab, A. A.↗

NASA NTRS1998

The Modeling Clay Approach to Bio-Inspired Electronic Hardware

The field of evolvable hardware or bio-inspired hardware holds the promise of automatically engineering complex electronic systems that remain adaptive and fault-tolerant during use.

Modeling Clay Electronic Hardware algorithm↗

NASA NTRS1995

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

NASA NTRS1994

A Simple Physical Optics Algorithm Perfect for Parallel Computing Architecture

A reflector antenna computer program based upon a simple discreet approximation of the radiation integral has proven to be extremely easy to adapt to the parallel computing architecture of the modest number of large-gain computing elements such as are used in the Intel iPSC and Touchstone Delta parallel machines.

reflector antenna Intel iPSC Touchstone Delta↗

NASA NTRS1994

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗

NASA NTRS1995

Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

Coirier, William J.↗

NASA NTRS1986

An upwind algorithm for the parabolized Navier-Stokes equations

A new upwind algorithm based on Roe's scheme has been developed to solve the two-dimensional parabolized Navier-Stokes (PNS) equations. This method does not require the addition of user specified smoothing terms for the capture of discontinuities such as shock waves. Thus, the method is easy to use and can be applied without modification to a wide variety of supersonic flowfields. The advantages and disadvantages of this adaptation are discussed in relation to those of the conventional Beam-Warming scheme in terms of accuracy, stability, computer time and storage, and programming effort. The new algorithm has been validated by applying it to three laminar test cases including flat plate boundary-layer flow, hypersonic flow past a 15 deg compression corner, and hypersonic flow into a converging inlet. The computed results compare well with experiment and show a dramatic improvement in the resolution of flowfield details when compared with the results obtained using the conventional Beam-Warming algorithm.

Lawrence, S. L.↗

NASA NTRS1983

Phased arrays for satellites and the TDRSS antennas

The design and performance of satellite phased-array systems are examined by considering several specific antennas built for spacecraft use. Particular consideration is given to: (1) the JARED (Jammer Reduction Antenna System) antenna, and adaptive phased array which can be used to null jammer signals while providing coverage to specific user areas; (2) the algorithm used in the JARED antenna; and (3) a technique that can be used to detect and locate jammers. The antennas used by the Tracking and Data Relay Satellite System (TDRSS) are then described. A significant aspect of the TDRSS is the multiple access antenna which is a 30-element phased array, providing a single steered beam on transmit and the ability to receive data from 20 simultaneous users. Also included on the TDRSS is a mesh deployable reflector and a C-band and K-band communications system.

Imbriale, W. A.↗

NASA NTRS1986

An architecture for intelligent interfaces - Outline of an approach to supporting operators of complex systems

The conceptual design of a comprehensive support system for operators of complex systems is presented. Key functions within the support system architecture include information management, error monitoring, and adaptive aiding. One of the central knowledge bases underlying this functionality is an operator model that involves a 'matrix' of algorithmic and symbolic models for assessing and predicting an operator's activities, awareness resources, intentions, and performance. Functional block diagrams are presented for the overall architecture as well as the key elements within this architecture. A variety of difficult design issues are discussed and ongoing efforts aimed at resolving these issues are noted.

Rouse, W. B.↗

NASA NTRS1988

Accurate multigrid solution of the Euler equations on unstructured and adaptive meshes

A method for accurately solving inviscid compressible flow in the subcritical and supercritical regimes about complex configurations is presented. The method is based on the use of unstructured triangular meshes in two dimensions, and special emphasis is placed on the accuracy and efficiency of the solutions. High accuracy is achieved by careful scaling of the artificial dissipation terms, and by reformulating the inner and outer boundary conditions for both the convective and dissipative operators. An adaptive grid refinement strategy is presented which enhances the solution accuracy for complex flows. When coupled with an unstructured multigrid algorithm, this method is shown to produce an efficient solver for flows about arbitrary configurations.

Mavriplis, Dimitri J.↗

NASA NTRS1987

Theoretical analysis of aircraft afterbody flow

Computational methods solving the thin shear layer formulation of the compressible, Reynolds-averaged Navier-Stokes equations are presently used to investigate the strongly interactive flow field about aircraft afterbodies. Solutions for a variety of axisymmetric afterbody and nozzle geometries are solved by means of a time-dependent implicit numerical algorithm for both subsonic and supersonic external flows, and the results obtained are compared with experimental data. A novel adaptive-grid technique is used to resolve flow regimes having large gradients, as well as to improve the accuracy and efficiency of the computational scheme.

Deiwert, George S.↗

NASA NTRS1988

Accurate multigrid solution of the Euler equations on unstructured and adaptive meshes

Mavriplis, Dimitri J.↗

NASA NTRS1992

Signal processing methodologies for an acoustic fetal heart rate monitor

Research and development is presented of real time signal processing methodologies for the detection of fetal heart tones within a noise-contaminated signal from a passive acoustic sensor. A linear predictor algorithm is utilized for detection of the heart tone event and additional processing derives heart rate. The linear predictor is adaptively 'trained' in a least mean square error sense on generic fetal heart tones recorded from patients. A real time monitor system is described which outputs to a strip chart recorder for plotting the time history of the fetal heart rate. The system is validated in the context of the fetal nonstress test. Comparisons are made with ultrasonic nonstress tests on a series of patients. Comparative data provides favorable indications of the feasibility of the acoustic monitor for clinical use.

Pretlow, Robert A., III↗

NASA NTRS1997

Improving Search Properties in Genetic Programming

With the advancing computer processing capabilities, practical computer applications are mostly limited by the amount of human programming required to accomplish a specific task. This necessary human participation creates many problems, such as dramatically increased cost. To alleviate the problem, computers must become more autonomous. In other words, computers must be capable to program/reprogram themselves to adapt to changing environments/tasks/demands/domains. Evolutionary computation offers potential means, but it must be advanced beyond its current practical limitations. Evolutionary algorithms model nature. They maintain a population of structures representing potential solutions to the problem at hand. These structures undergo a simulated evolution by means of mutation, crossover, and a Darwinian selective pressure. Genetic programming (GP) is the most promising example of an evolutionary algorithm. In GP, the structures that evolve are trees, which is a dramatic departure from previously used representations such as strings in genetic algorithms. The space of potential trees is defined by means of their elements: functions, which label internal nodes, and terminals, which label leaves. By attaching semantic interpretation to those elements, trees can be interpreted as computer programs (given an interpreter), evolved architectures, etc. JSC has begun exploring GP as a potential tool for its long-term project on evolving dextrous robotic capabilities. Last year we identified representation redundancies as the primary source of inefficiency in GP. Subsequently, we proposed a method to use problem constraints to reduce those redundancies, effectively reducing GP complexity. This method was implemented afterwards at the University of Missouri. This summer, we have evaluated the payoff from using problem constraints to reduce search complexity on two classes of problems: learning boolean functions and solving the forward kinematics problem. We have also developed and implemented methods to use additional problem heuristics to fine-tune the searchable space, and to use typing information to further reduce the search space. Additional improvements have been proposed, but they are yet to be explored and implemented.

Janikow, Cezary Z.↗

NASA NTRS1999

Improved Stratospheric Temperature Retrievals for Climate Reanalysis

The Data Assimilation Office (DAO) is embarking on plans to generate a twenty year reanalysis data set of climatic atmospheric variables. One of the focus points will be in the evaluation of the dynamics of the stratosphere. The Stratospheric Sounding Unit (SSU), flown as part of the TIROS Operational Vertical Sounder (TOVS), is one of the primary stratospheric temperature sensors flown consistently throughout the reanalysis period. Seven unique sensors made the measurements over time, with individual instrument characteristics that need to be addressed. The stratospheric temperatures being assimilated across satellite platforms will profoundly impact the reanalysis dynamical fields. To attempt to quantify aspects of instrument and retrieval bias we are carefully collecting and analyzing all available information on the sensors, their instrument anomalies, forward model errors and retrieval biases. For the retrieval of stratospheric temperatures, we adapted the minimum variance approach of Jazwinski (1970) and Rodgers (1976) and applied it to the SSU soundings. In our algorithm, the state vector contains an initial guess of temperature from a model six hour forecast provided by the Goddard EOS Data Assimilation System (GEOS/DAS). This is combined with an a priori covariance matrix, a forward model parameterization, and specifications of instrument noise characteristics. A quasi-Newtonian iteration is used to obtain convergence of the retrieved state to the measurement vector. This algorithm also enables us to analyze and address the systematic errors associated with the unique characteristics of the cell pressures on the individual SSU instruments and the resolving power of the instruments to vertical gradients in the stratosphere. The preliminary results of the improved retrievals and their assimilation as well as baseline calculations of bias and rms error between the NESDIS operational product and col-located ground measurements will be presented.

Rokke, L.↗