SEARCH · Engineering Papers

Results for “vectorization”

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,477 records · Page 82

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Communications and control for electric power systems: Power flow classification for static security assessment

This report investigates the classification of power system states using an artificial neural network model, Kohonen's self-organizing feature map. The ultimate goal of this classification is to assess power system static security in real-time. Kohonen's self-organizing feature map is an unsupervised neural network which maps N-dimensional input vectors to an array of M neurons. After learning, the synaptic weight vectors exhibit a topological organization which represents the relationship between the vectors of the training set. This learning is unsupervised, which means that the number and size of the classes are not specified beforehand. In the application developed in this report, the input vectors used as the training set are generated by off-line load-flow simulations. The learning algorithm and the results of the organization are discussed.

Niebur, D.↗

NASA NTRS1994

A simple suboptimal least-squares algorithm for attitude determination with multiple sensors

Three-axis attitude determination is equivalent to finding a coordinate transformation matrix which transforms a set of reference vectors fixed in inertial space to a set of measurement vectors fixed in the spacecraft. The attitude determination problem can be expressed as a constrained optimization problem. The constraint is that a coordinate transformation matrix must be proper, real, and orthogonal. A transformation matrix can be thought of as optimal in the least-squares sense if it maps the measurement vectors to the reference vectors with minimal 2-norm errors and meets the above constraint. This constrained optimization problem is known as Wahba's problem. Several algorithms which solve Wahba's problem exactly have been developed and used. These algorithms, while steadily improving, are all rather complicated. Furthermore, they involve such numerically unstable or sensitive operations as matrix determinant, matrix adjoint, and Newton-Raphson iterations. This paper describes an algorithm which minimizes Wahba's loss function, but without the constraint. When the constraint is ignored, the problem can be solved by a straightforward, numerically stable least-squares algorithm such as QR decomposition. Even though the algorithm does not explicitly take the constraint into account, it still yields a nearly orthogonal matrix for most practical cases; orthogonality only becomes corrupted when the sensor measurements are very noisy, on the same order of magnitude as the attitude rotations. The algorithm can be simplified if the attitude rotations are small enough so that the approximation sin(theta) approximately equals theta holds. We then compare the computational requirements for several well-known algorithms. For the general large-angle case, the QR least-squares algorithm is competitive with all other know algorithms and faster than most. If attitude rotations are small, the least-squares algorithm can be modified to run faster, and this modified algorithm is faster than all but a similarly specialized version of the QUEST algorithm. We also introduce a novel measurement averaging technique which reduces the n-measurement case to the two measurement case for our particular application, a star tracker and earth sensor mounted on an earth-pointed geosynchronous communications satellite. Using this technique, many n-measurement problems reduce to less than or equal to 3 measurements; this reduces the amount of required calculation without significant degradation in accuracy. Finally, we present the results of some tests which compare the least-squares algorithm with the QUEST and FOAM algorithms in the two-measurement case. For our example case, all three algorithms performed with similar accuracy.

Brozenec, Thomas F.↗

NASA NTRS1994

X-31 quasi-tailless flight demonstration

The primary objective of the quasi-tailless flight demonstration is to demonstrate the feasibility of using thrust vectoring for directional control of an unstable aircraft. By using this low-cost, low-risk approach it is possible to get information about required thrust vector control power and deflection rates from an inflight experiment as well as insight in low-power thrust vectoring issues. The quasi-tailless flight demonstration series with the X-31 began in March 1994. The demonstration flight condition was Mach 1.2 at 37,500 feet. A series of basic flying quality maneuvers, doublets, bank to bank rolls, and wind-up-turns have been performed with a simulated 100% vertical tail reduction. Flight test and supporting simulation demonstrated that the quasi-tailless approach is effective in representing the reduced stability of tailless configurations. The flights also demonstrated that thrust vectoring could be effectively used to stabilize a directionally unstable configuration and provide control power for maneuver coordination.

Huber, Peter↗

NASA NTRS1994

Error control techniques for satellite and space communications

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

Costello, Daniel J., Jr.↗

NASA NTRS1995

Feedback control laws for highly maneuverable aircraft

During this year, we concentrated our efforts on the design of controllers for lateral/directional control using mu synthesis. This proved to be a more difficult task than we anticipated and we are still working on the designs. In the lateral-directional control problem, the inputs are pilot lateral stick and pedal commands and the outputs are roll rate about the velocity vector and side slip angle. The control effectors are ailerons, rudder deflection, and directional thrust vectoring vane deflection which produces a yawing moment about the body axis. Our math model does not contain any provision for thrust vectoring of rolling moment. This has resulted in limitations of performance at high angles of attack. During 1994-95, the following tasks for the lateral-directional controllers were accomplished: (1) Designed both inner and outer loop dynamic inversion controllers. These controllers are implemented using accelerometer outputs rather than an a priori model of the vehicle aerodynamics; (2) Used classical techniques to design controllers for the system linearized by dynamics inversion. These controllers acted to control roll rate and Dutch roll response; (3) Implemented the inner loop dynamic inversion and classical controllers on the six DOF simulation; (4) Developed a lateral-directional control allocation scheme based on minimizing required control effort among the ailerons, rudder, and directional thrust vectoring; and (5) Developed mu outer loop controllers combined with classical inner loop controllers.

Garrard, William L.↗

NASA NTRS1993

A model for the motion of the Philippine Sea plate consistent with NUVEL-1 and geological data

We investigate angular velocity vectors of the Philippine Sea (PH) plate relative to the adjacent major plates, Eurasia (EU) and Pacific (PA), and the smaller Caroline (CR) plate. Earthquake slip vector data along the Philippine Sea plate are inverted, subject to the constraint that EU-PA motion equals that predicted by the global relative plate model NUVEL-1. The resulting solution fails to satisfy geological constraints along the Caroline-Pacific boundary: convergence along the Mussau Trench and divergence along the Sorol Trough. We then seek solutions satisfying both the CR-PA boundary conditions and the Philippine Sea slip vector data, by adjusting the PA-PH and EU-PH best fitting poles within their error ellipses. We also consider northern Honshu to be part of the North American plate and impose the constraint that the Philippine Sea plate subducts beneath northern Honshu along the Sagmi Trough in a NNW-NW direction. Of the solutions satisfying these conditions, we select the best EU-PH as 48.2 deg N, 157.0 deg E, 1.09 deg/my, corresponding to a pole far from Japan and south of Kamchatka, and PA-PH, 1.2 deg N, 134.2 deg E, 1.00 deg/my. Predicted NA-PH and EU-PH convergence rates in central Honshu are consistent with estimated seismic slip rates. Previous estimates of the EU-PH pole close to central Honshu are inconsistent with extension within the Bonin backarc implied by earthquake slip vectors and NNW-NW convergence of the Bonin forearc at the Sagami Trough.

Seno, Tetsuzo↗

NASA NTRS1995

Associative Pattern Recognition In Analog VLSI Circuits

Winner-take-all circuit selects best-match stored pattern. Prototype cascadable very-large-scale integrated (VLSI) circuit chips built and tested to demonstrate concept of electronic associative pattern recognition. Based on low-power, sub-threshold analog complementary oxide/semiconductor (CMOS) VLSI circuitry, each chip can store 128 sets (vectors) of 16 analog values (vector components), vectors representing known patterns as diverse as spectra, histograms, graphs, or brightnesses of pixels in images. Chips exploit parallel nature of vector quantization architecture to implement highly parallel processing in relatively simple computational cells. Through collective action, cells classify input pattern in fraction of microsecond while consuming power of few microwatts.

Tawel, Raoul↗

NASA NTRS1996

Correction of WindScat Scatterometric Measurements by Combining with AMSR Radiometric Data

The Seawinds scatterometer on the advanced Earth observing satellite-2 (ADEOS-2) will determine surface wind vectors by measuring the radar cross section. Multiple measurements will be made at different points in a wind-vector cell. When dense clouds and rain are present, the signal will be attenuated, thereby giving erroneous results for the wind. This report describes algorithms to use with the advanced mechanically scanned radiometer (AMSR) scanning radiometer on ADEOS-2 to correct for the attenuation. One can determine attenuation from a radiometer measurement based on the excess brightness temperature measured. This is the difference between the total measured brightness temperature and the contribution from surface emission. A major problem that the algorithm must address is determining the surface contribution. Two basic approaches were developed for this, one using the scattering coefficient measured along with the brightness temperature, and the other using the brightness temperature alone. For both methods, best results will occur if the wind from the preceding wind-vector cell can be used as an input to the algorithm. In the method based on the scattering coefficient, we need the wind direction from the preceding cell. In the method using brightness temperature alone, we need the wind speed from the preceding cell. If neither is available, the algorithm can work, but the corrections will be less accurate. Both correction methods require iterative solutions. Simulations show that the algorithms make significant improvements in the measured scattering coefficient and thus is the retrieved wind vector. For stratiform rains, the errors without correction can be quite large, so the correction makes a major improvement. For systems of separated convective cells, the initial error is smaller and the correction, although about the same percentage, has a smaller effect.

Song, S.↗

NASA NTRS1996

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

Bar-Itzhack, Itzhack Y.↗

NASA NTRS1995

Comparison of Satellite-Derived Wind Measurements with Other Wind Measurement Sensors

The purpose of this paper is to compare the good data from the Jimsphere launches with the data from the satellite system. By comparing the wind speeds from the Fixed Pedestal System 16 (FPS-16) Radar/Jimsphere Wind System and NASA's 50-MHz Radar Wind Profiler, the validation of winds from Geostationary Operational Environmental Satellite 7 (GOES-7) is performed. This study provides an in situ data quality check for the GOES-7 satellite winds. Comparison was made of the flowfields in the troposphere and the lower stratosphere of case studies of pairs of Jimsphere balloon releases and Radar Wind Profiler winds during Space Shuttle launches. The mean and standard deviation of the zonal component statistics, the meridional component statistics, and the power spectral density curves show good agreement between the two wind sensors. The standard deviation of the u and v components for the STS-37 launch (consisting of five Jimsphere/Radar Wind Profiler data sets) was 1.92 and 1.67 m/s, respectively; for the STS-43 launch (there were six Jimsphere/Wind Profiler data sets) it was 1.39 and 1.44 m/s, respectively. The overall standard deviation was 1.66 m/s for the u component and 1.55 m/s tor the v component, and a standard deviation of 2.27 m/s tor the vector wind difference. The global comparison of satellite with Jimsphere balloon vector winds shows a standard deviation of 3.15 m/s for STS-43 and 4.37 m/s for STS-37. The overall standard deviation of the vector wind was 3.76 m/s, with a root-mean-square vector difference of 4.43 m/s. These data have demonstrated that this unique comparison of the Jimsphere and satellite winds provides excellent ground truth and a frame of reference during testing and validation of satellite data

Susko, Michael↗

NASA NTRS1996

Conditional Entropy-Constrained Residual VQ with Application to Image Coding

This paper introduces an extension of entropy-constrained residual vector quantization (VQ) where intervector dependencies are exploited. The method, which we call conditional entropy-constrained residual VQ, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. When applied to coding images, the proposed method is shown to achieve better rate-distortion performance than that of entropy-constrained residual vector quantization with less computational complexity and lower memory requirements. Moreover, it can be designed to support progressive transmission in a natural way. It is also shown to outperform some of the best predictive and finite-state VQ techniques reported in the literature. This is due partly to the joint optimization between the residual vector quantizer and a high-order conditional entropy coder as well as the efficiency of the multistage residual VQ structure and the dynamic nature of the prediction.

Kossentini, Faouzi↗

NASA NTRS1997

Internal Performance of a Fixed-Shroud Nonaxisymmetric Nozzle Equipped with an Aft-Hood Exhaust Deflector

An investigation was conducted in the model preparation area of the Langley 16-Foot Transonic Tunnel to determine the internal performance of a fixed-shroud nonaxisymmetric nozzle equipped with an aft-hood exhaust deflector. Model geometric parameters investigated included nozzle power setting, aft-hood deflector angle, throat area control with the aft-hood deflector deployed, and yaw vector angle. Results indicate that cruise configurations produced peak performance in the range consistent with previous investigations of nonaxisymmetric convergent-divergent nozzles. The aft-hood deflector produced resultant pitch vector angles that were always less than the geometric aft-hood deflector angle when the nozzle throat was positioned upstream of the deflector exit. Significant losses in resultant thrust ratio occurred when the aft-hood deflector was deployed with an upstream throat location. At each aft-hood deflector angle, repositioning the throat to the deflector exit improved pitch vectoring performance and, in some cases, substantially improved resultant thrust ratio performance. Transferring the throat to the deflector exit allowed the flow to be turned upstream of the throat at subsonic Mach numbers, thereby eliminating losses associated with turning supersonic flow. Internal throat panel deflections were largely unsuccessful in generating yaw vectoring.

Asbury, Scott C.↗

NASA NTRS1998

Optimal integer resolution for attitude determination using global positioning system signals

In this paper, a new motion-based algorithm for GPS integer ambiguity resolution is derived. The first step of this algorithm converts the reference sightline vectors into body frame vectors. This is accomplished by an optimal vectorized transformation of the phase difference measurements. The result of this transformation leads to the conversion of the integer ambiguities to vectorized biases. This essentially converts the problem to the familiar magnetometer-bias determination problem, for which an optimal and efficient solution exists. Also, the formulation in this paper is re-derived to provide a sequential estimate, so that a suitable stopping condition can be found during the vehicle motion. The advantages of the new algorithm include: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can sequentially estimate the ambiguities during the vehicle motion. The only disadvantage of the new algorithm is that it requires at least three non-coplanar baselines. The performance of the new algorithm is tested on a dynamic hardware simulator.

Crassidis, John L.↗

NASA NTRS1997

Biweekly Maps of Wind Stress for the North Pacific from the ERS-1 Scatterometer

The European Remote-sensing Satellite (ERS-1) was launched in July 1991 and contained several instruments for observing the Earth's ocean including a wind scatterometer. The scatterometer measurements were processed by the European Space Agency (ESA) and the Jet Propulsion Laboratory (JPL). JPL reprocessed (Freilich and Dunbar, 1992) the ERS-1 backscatter measurements to produced a 'value added' data set that contained the ESA wind vector as well as a set of up to four ambiguities. These ambiguities were further processed using a maximum-likelihood estimation (MLE) and a median filter to produce a 'selected vector.' This report describes a technique developed to produce time-averaged wind field estimates with their expected errors using only scatterometer wind vectors. The processing described in this report involved extracting regions of interest from the data tapes, checking the quality and creating the wind field estimate. This analysis also includes the derivation of biweekly average wind vectors over the North Pacific Ocean at a resolution of 0.50 x 0.50. This was done with an optimal average algorithm temporally and an over-determined biharmonic spline spatially. There have been other attempts at creating gridded wind files from ERS-1 winds, e.g., kriging techniques (Bentamy et al., 1996) and successive corrections schemes (Tang and Liu, 1996). There are several inherent problems with the ERS-1 scatterometer. Since this is a multidisciplinary mission, the satellite is flown in different orbits optimized for each phase of the mission. The scatterometer also shares several sub-systems with the Synthetic Aperture Radar (SAR) and cannot be operated while the SAR is in operation. The scatterometer is also a single-sided instrument and only measures backscatter along the right side of the satellite. The processing described here generates biweekly wind maps during the wktwo years analysis period regardless of the satellite orbit or missing data.

SYNTHETIC APERTURE RADAR↗

NASA NTRS1999

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Larson, J. W.↗

NASA NTRS1998

An Alternative Lunar Ephemeris Model for On-Board Flight Software Use

In calculating the position vector of the Moon in on-board flight software, one often begins by using a series expansion to calculate the ecliptic latitude and longitude of the Moon, referred to the mean ecliptic and equinox of date. One then performs a reduction for precession, followed by a rotation of the position vector from the ecliptic plane to the equator, and a transformation from spherical to Cartesian coordinates before finally arriving at the desired result: equatorial J2000 Cartesian components of the lunar position vector. An alternative method is developed here in which the equatorial J2000 Cartesian components of the lunar position vector are calculated directly by a series expansion, saving valuable on-board computer resources.

Simpson, David G.↗

NASA NTRS1999

An Alternative Lunar Ephemeris Model for On-Board Flight Software Use

Simpson, David G.↗

NASA NTRS1999

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗