Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linearization error”

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 271 records · Page 15

Allan deviation computations of a linear frequency synthesizer system using frequency domain techniques

Allan Deviation computations of linear frequency synthesizer systems have been reported previously using real-time simulations. Even though it takes less time compared with the actual measurement, it is still very time consuming to compute the Allan Deviation for long sample times with the desired confidence level. Also noises, such as flicker phase noise and flicker frequency noise, can not be simulated precisely. The use of frequency domain techniques can overcome these drawbacks. In this paper the system error model of a fictitious linear frequency synthesizer is developed and its performance using a Cesium (Cs) atomic frequency standard (AFS) as a reference is evaluated using frequency domain techniques. For a linear timing system, the power spectral density at the system output can be computed with known system transfer functions and known power spectral densities from the input noise sources. The resulting power spectral density can then be used to compute the Allan Variance at the system output. Sensitivities of the Allan Variance at the system output to each of its independent input noises are obtained, and they are valuable for design trade-off and trouble-shooting.

Wu, Andy↗

Preliminary Jitter Stability Results for the Large UV/Optical/Infrared (LUVOIR) Surveyor Concept Using a Non-Contact Vibration Isolation and Precision Pointing System

The need for high payload dynamic stability and ultra-stable mechanical systems is an overarching technology need for large space telescopes such as the Large Ultraviolet / Optical / Infrared (LUVOIR) Surveyor concept. The LUVOIR concept includes a 15-meter-diameter segmented-aperture telescope with a suite of serviceable instruments operating over a range of wavelengths between 100nm to 2.5 um. Wavefront error (WFE) stability of less than 10 picometers RMS of uncorrected system WFE per wavefront control step represents a drastic performance improvement over current space-based telescopes being fielded. Through the utilization of an isolation architecture that involves no mechanical contact between the telescope and the host spacecraft structure, a system design is realized that maximizes the telescope dynamic stability performance without driving stringent technology requirements on spacecraft structure, sensors or actuators. Through analysis of the LUVOIR finite element model and linear optical model, the wavefront error and Line-Of-Sight (LOS) jitter performance is discussed in this paper when using the Vibration Isolation and Precision Pointing System (VIPPS) being developed cooperatively with Lockheed Martin in addition to a multi-loop control architecture. The multi-loop control architecture consists of the spacecraft Attitude Control System (ACS), VIPPS, and a Fast Steering Mirror on the instrument. While the baseline attitude control device for LUVOIR is a set of Control Moment Gyroscopes (CMGs), Reaction Wheel Assembly (RWA) disturbance contribution to wavefront error stability and LOS stability are presented to give preliminary results in this paper. CMG disturbance will be explored in further work to be completed.

Sacks, Lia W.↗

Navigation Strategies for Primitive Solar System Body Rendezvous and Proximity Operations

A wealth of scientific knowledge regarding the composition and evolution of the solar system can be gained through reconnaissance missions to primitive solar system bodies. This paper presents analysis of a baseline navigation strategy designed to address the unique challenges of primitive body navigation. Linear covariance and Monte Carlo error analysis was performed on a baseline navigation strategy using simulated data from a· design reference mission (DRM). The objective of the DRM is to approach, rendezvous, and maintain a stable orbit about the near-Earth asteroid 4660 Nereus. The outlined navigation strategy and resulting analyses, however, are not necessarily limited to this specific target asteroid as they may he applicable to a diverse range of mission scenarios. The baseline navigation strategy included simulated data from Deep Space Network (DSN) radiometric tracking and optical image processing (OpNav). Results from the linear covariance and Monte Carlo analyses suggest the DRM navigation strategy is sufficient to approach and perform proximity operations in the vicinity of the target asteroid with meter-level accuracy.

Getzandanner, Kenneth M.↗

Mass Inferencing Model Creation and Deployment to the RASSOR Lunar Excavation Robot

The Regolith Advanced Surface Systems Operations Robot (RASSOR) Excavator is a teleoperated mobile robotic platform with a unique space regolith excavation capability. The Intelligent Capabilities Enhanced RASSOR research project developed functionality for inferencing regolith mass ingested during RASSOR operation, enhancing RASSOR’s ability to successfully complete ISRU missions. To teleoperate or run autonomously, it is crucial for the quantity of regolith mass ingested by RASSOR to be available as a system state for efficient operation. For example, during autonomous operation, RASSOR should navigate and move to a processing plant to offload the collected regolith when the drums are full; without knowledge of how much mass is in the drums, this type of high-level planning is not possible. Four distinct modeling approaches were employed in developing a mass inferencing approach that could work on RASSOR. All take in system states, such as arm/drum positions, velocities, currents, voltages, and robot pose, and output a mass prediction for each set of the robot’s bucket drums.1) A neural network model that takes a vector of normalized system states; 2) A model that uses the integrated power consumption of an arm-raise (normalized by velocity); 3) A model that uses average drum current over a variable length interval of the drum disengaged from the surface; and 4) A real-time estimation model that aggregates excavation drum current. The developed models run in real time, outputting predictions for the front and rear drums, timestamp of the last prediction, and total mass in RASSOR’s drums. Further testing is required to validate the arm-raise model (2), though initial tests indicate reasonable performance (<10% mean error) on the hardware. The linear fit of average drum-current model (3) had a front value of r^2=0.99 and a rear value of r^2=0.98 on the validation dataset. This model currently has the best performance on unseen data. The real time model (4) is still in development, though initial results on a small subset of the training data show that it has high accuracy in predicting the increase in mass during excavation. Though work remains to be done with deploying a high-fidelity model to the physical system that makes predictions with error below the desired threshold, the modular architecture for model development allows quick adjustment of parameters to increase model fidelity. This architecture can also be adapted to use lunar excavation data to create models that are reflective of RASSOR’s dynamics when operating on the lunar surface. The results are promising as it has been shown that models can be developed that accurately estimate excavated regolith mass.

rassor↗

Simplified Convolution Codes

Simple recursive algorithm efficiently calculates minimum-weight error vectors using Diophantine equations. Recursive algorithm uses general solution of polynomial linear Diophantine equation to determine minimum-weight error polynomial vector in equation in polynomial space.

Truong, T. K.↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

An Innovative Control Allocation Scheme to Address Reaction Thruster Interactions on a 3U CubeSat

A wealth of literature exists on control allocation algorithms for over-actuated air vehicles, launch vehicles, and spacecraft's. Most of these algorithms focus primarily on minimizing some objective function such as command tracking error and/or control effector usage. Linear allocators (pseudo inverses) are usually the conventional choice due to their simplicity and the ability to achieve a significant portion of the theoretical moment/impulse space. Generally, it is assumed that there exists minimal interaction effects between control effectors. In fact, very few studies address the problem of control effector interactions in the context of control allocation, especially for small spacecraft's with a reaction control system (RCS). This paper presents a CubeSat RCS design with a four thruster tetrahedral layout such that when two or more thrusters re, the resultant impulse differs noticeably compared to the sum of the contributions from individual thruster rings. This undesirable effect is caused by the design of the propellant tank and regulator. To mitigate this issue, an innovative modified pseudo inverse (MPI) control allocation algorithm was developed that adjusts the pseudo inverse solution based on test data. The algorithm is iteration-free and superior to the standard pseudo inverse in minimizing the command tracking error.

Pei, Jing↗

On the equivalence of Gaussian elimination and Gauss-Jordan reduction in solving linear equations

A novel general approach to round-off error analysis using the error complexity concepts is described. This is applied to the analysis of the Gaussian Elimination and Gauss-Jordan scheme for solving linear equations. The results show that the two algorithms are equivalent in terms of our error complexity measures. Thus the inherently parallel Gauss-Jordan scheme can be implemented with confidence if parallel computers are available.

Tsao, Nai-Kuan↗

Performance analysis of a cascaded coding scheme with interleaved outer code

A cascaded coding scheme for a random error channel with a bit-error rate is analyzed. In this scheme, the inner code C sub 1 is an (n sub 1, m sub 1l) binary linear block code which is designed for simultaneous error correction and detection. The outer code C sub 2 is a linear block code with symbols from the Galois field GF (2 sup l) which is designed for correcting both symbol errors and erasures, and is interleaved with a degree m sub 1. A procedure for computing the probability of a correct decoding is presented and an upper bound on the probability of a decoding error is derived. The bound provides much better results than the previous bound for a cascaded coding scheme with an interleaved outer code. Example schemes with inner codes ranging from high rates to very low rates are evaluated. Several schemes provide extremely high reliability even for very high bit-error rates say 10 to the -1 to 10 to the -2 power.

Lin, S.↗

Protograph based LDPC codes with minimum distance linearly growing with block size

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.

minimum decoding↗

Higher order accurate partial implicitization: An unconditionally stable fourth-order-accurate explicit numerical technique

The previously obtained second-order-accurate partial implicitization numerical technique used in the solution of fluid dynamic problems was modified with little complication to achieve fourth-order accuracy. The Von Neumann stability analysis demonstrated the unconditional linear stability of the technique. The order of the truncation error was deduced from the Taylor series expansions of the linearized difference equations and was verified by numerical solutions to Burger's equation. For comparison, results were also obtained for Burger's equation using a second-order-accurate partial-implicitization scheme, as well as the fourth-order scheme of Kreiss.

Graves, R. A., Jr.↗

Symbolic-numeric interface: A review

A survey of the use of a combination of symbolic and numerical calculations is presented. Symbolic calculations primarily refer to the computer processing of procedures from classical algebra, analysis, and calculus. Numerical calculations refer to both numerical mathematics research and scientific computation. This survey is intended to point out a large number of problem areas where a cooperation of symbolic and numerical methods is likely to bear many fruits. These areas include such classical operations as differentiation and integration, such diverse activities as function approximations and qualitative analysis, and such contemporary topics as finite element calculations and computation complexity. It is contended that other less obvious topics such as the fast Fourier transform, linear algebra, nonlinear analysis and error analysis would also benefit from a synergistic approach.

Ng, E. W.↗

Simplified Syndrome Decoding of (n, 1) Convolutional Codes

A new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.

I. S. Reed↗

Impact of LANDSAT MSS sensor differences on change detection analysis

Some 512 by 512 pixel subwindows for simultaneously acquired scene pairs obtained by LANDSAT 2,3 and 4 multispectral band scanners were coregistered using LANDSAT 4 scenes as the base to which the other images were registered. Scattergrams between the coregistered scenes (a form of contingency analysis) were used to radiometrically compare data from the various sensors. Mode values were derived and used to visually fit a linear regression. Root mean square errors of the registration varied between .1 and 1.5 pixels. There appear to be no major problem preventing the use of LANDSAT 4 MSS with previous MSS sensors for change detection, provided the noise interference can be removed or minimized. Data normalizations for change detection should be based on the data rather than solely on calibration information. This allows simultaneous normalization of the atmosphere as well as the radiometry.

Likens, W. C.↗

New Syndrome Decoding Techniques for the (n, K) Convolutional Codes

This paper presents a new syndrome decoding algorithm for the (n,k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3,1)CC.

Reed, I. S.↗

New syndrome decoder for (n, 1) convolutional codes

The letter presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new technique uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). A recursive, Viterbi-like, algorithm is developed to find the minimum weight error vector E(D). An example is given for the binary nonsystematic (2, 1) CC.

Reed, I. S.↗

Ultrasonic transducer with a two-dimensional Gaussian field profile

A transducer is described which generates a two-dimensional Gaussian field by controlling both the position of multiple circular electrodes and the voltage applied to each electrode. The transducer is constructed by depositing concentric rings electrodes onto one flat surface of a circular piezoelectric crystal disk and attaching the rings to an impedance matching network which acts as a voltage divider. Geometrical inter-ring separations and electrical inter-ring impedances are designed to minimize the error between the generated acoustic field, modeled as a piecewise linear function, and the desired Gaussian distribution. Total mean squared error between the averaged far-field data and a Gaussian shape is less than two percent.

Claus, R. O.↗

New syndrome decoding techniques for the (n, k) convolutional codes

This paper presents a new syndrome decoding algorithm for the (n, k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3, 1)CC. Previously announced in STAR as N83-34964

Reed, I. S.↗