Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sequential”

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 217 records · Page 12

Worst-error analysis of batch filter and sequential filter in navigation problems

This paper proposes a worst-error analysis for dealing with problems of estimation of spacecraft trajectories in deep space missions. Navigation filters in use assume either constant or stochastic (Markov) models for their estimated parameters. When the actual behavior of these parameters does not follow the pattern of the assumed model, the filters sometimes result in very poor performance. To prepare for such pathological cases, the worst errors of both batch and sequential filters are investigated based on the incremental sensitivity studies of these filters. By finding critical switching instances of non-gravitational accelerations, intensive tracking can be carried out around those instances. Also the worst errors in the target plane provide a measure in assignment of the propellant budget for trajectory corrections. Thus the worst-error study presents useful information as well as practical criteria in establishing the maneuver and tracking strategy of spacecraft's missions.

Nishimura, T.↗

Optimization of system reliability by the sequential unconstrained minimization technique

The reliability of a complex system was optimized by a new approach for implementing the sequential unconstrained minimization technique (SUMT) with the aid of Hooke and Jeeves pattern search and heuristic programming. Two optimization problems were considered. In the first, the system reliability was maximized subject to a nonlinear weight constraint. In the second, the weight of the system was minimized without violating the requirements of the minimal system reliability and the minimum reliability for each component. The sensitivities of the system reliability and that of the system weight to the reliability of each component were determined under optimal conditions.

Hwang, C. L.↗

Comparison of rate one-half, equivalent constraint length 24, binary convolutional codes for use with sequential decoding on the deep-space channel

Virtually all previously-suggested rate 1/2 binary convolutional codes with KE = 24 are compared. Their distance properties are given; and their performance, both in computation and in error probability, with sequential decoding on the deep-space channel is determined by simulation. Recommendations are made both for the choice of a specific KE = 24 code as well as for codes to be included in future coding standards for the deep-space channel. A new result given in this report is a method for determining the statistical significance of error probability data when the error probability is so small that it is not feasible to perform enough decoding simulations to obtain more than a very small number of decoding errors.

Massey, J. L.↗

A new sequential decoder for the DSN telemetry subsystem

A sequential decoder was implemented in the DSS telemetry subsystem for the DSN MARK 3 data system implementation. This decoder performs the same decoding function as the data decoder assembly performs in the telemetry and command data handling subsystem. However, the new decoder is much faster, allowing potentially high data rates in the future.

Wilcher, J. H.↗

A detailed description of the sequential probability ratio test for 2-IMU FDI

The sequential probability ratio test (SPRT) for 2-IMU FDI (inertial measuring unit failure detection/isolation) is described. The SPRT is a statistical technique for detecting and isolating soft IMU failures originally developed for the strapdown inertial reference unit. The flowchart of a subroutine incorporating the 2-IMU SPRT is included.

Rich, T. M.↗

Two-IMU FDI performance of the sequential probability ratio test during shuttle entry

Performance data for the sequential probability ratio test (SPRT) during shuttle entry are presented. Current modeling constants and failure thresholds are included for the full mission 3B from entry through landing trajectory. Minimum 100 percent detection/isolation failure levels and a discussion of the effects of failure direction are presented. Finally, a limited comparison of failures introduced at trajectory initiation shows that the SPRT algorithm performs slightly worse than the data tracking test.

Rich, T. M.↗

The use of series-solutions for batch and sequential estimation

Iterative methods for the approximate solution of the nonlinear state estimation problem are investigated in which the solution is retained in the form of a finite series of Chebyshev polynomials. Algorithms are presented which allow the state to be estimated from observational data in either the batch or the sequential form. The advantages of these techniques are discussed.

Feagin, T.↗

Sequential decoding in the presence of a noisy carrier reference

A new model for predicting the computational performance of a sequential decoder operating in a noisy carrier reference environment is described. The major difference between this model and previous models is that the new model characterizes the number of computations per frame as the sum of the computations resulting from a number of independent searches. This number of independent searches can then be considered as an effective frame length. When this computational model is averaged over noisy reference phase errors using a medium-rate interpolation scheme, the results are found to agree quite favorably with experimental measurements.

Lesh, J. R.↗

A multilevel approach to sequential detection of pictorial features

The problem of detecting the local similarity between templates in a given class and a given image using a hierarchically ordered sequential decision rule is examined. It is proposed that the set of templates be partitioned and a 'representative template' be defined for each of the partitions. Several levels of partitioning are defined. Elimination of mismatching locations and termination of computation can take place at each level of detection. Each level of testing is over a more restrictive subset of the template class than the previous level. Criteria are given for selecting representative templates, the ordering of components of a template vector for error evaluation, and the threshold sequences to be used in deciding about a 'match'. Suboptimal solutions are given satisfying these criteria. Examples showing recognition of linear features in test patterns and photographs obtained by aerial and spaceborne sensors are provided.

Ramapriyan, H. K.↗

Sequential decoding in the presence of a noisy carrier reference

A new model for predicting the computational performance of a sequential decoder operating in a noisy carrier reference environment is described. The major difference between this model and previous models is that the new model characterizes the number of computations per frame as the sum of the computations resulting from a number of independent searches. This number of independent searches can then be considered as an effective frame length. When this computational model is averaged over noisy reference phase errors using a medium-rate interpolation scheme, the results are found to agree quite favorably with experimental measurements.

Lesh, J. R.↗

Development of a drive system for a sequential space camera contract modification 4(S)

The brush type dc motor and clutch were eliminated from the design of the 16 mm space sequential camera design and replaced by an electronically commutated motor. The new drive system reduces the current consumption at 24 fps to 220 mA. The drive can be programmed and controlled externally from the multipurpose programmable timer/intervalometer, as well as being controlled locally from the camera.

Sharpsteen, J. T.↗

On the error probability of general trellis codes with applications to sequential decoding

An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.

Johannesson, R.↗

Sequential High-Resolution Wind Profile Measurements

Tropospheric flow and lower stratospheric flow as measured by 94 sequences of high-resolution Jimsphere balloon data are presented and discussed. The 70 and 24 sequential series are presented for the Kennedy Space Center, Florida, and Point Mugu, California, areas, respectively. Supplemental data, consisting of the associative temperature profiles and surface and 200 mb synoptic maps, are also presented. The measurements are discussed relative to both the engineering and disciplinary areas. An initial subjective analysis of mesoscale features observed on some sequences is presented.

Johnson, D. L.↗

A sequential method for spline approximation with variable knots

In this paper we describe a method for approximating a waveform by a spline. The method is quite efficient, as the data are processed sequentially. The basis of the approach is to view the approximation problem as a question of estimation of a polynomial in noise, with the possibility of abrupt changes in the highest derivative. This allows us to bring several powerful statistical signal processing tools into play. We also present some initial results on the application of our technique to the processing of electrocardiograms, where the knot locations themselves may be some of the most important pieces of diagnostic information.

Mier Muth, A. M.↗

On the distribution of computation for sequential decoding using the stack algorithm

A method is developed for estimating the computational distribution for the stack algorithm for sequential decoding, that is, the probability that the computation required to decode the first branch of the tree is greater than or equal to N, for small N. The analysis relies heavily on the theory of multitype branching processes. A step in the analysis is the determination of the distribution of the minimum of the cumulative metrics along the transmitted path in the code tree. This is used to obtain the distribution of the number of computations made by the decoder in order to decode the first branch in the tree, and this random variable serves as an approximation of the average number of computations per decoded branch. At information rates below the cutoff rate, the calculated computational performance is virtually identical to that obtained by time-consuming simulations.

Johannesson, R.↗

Sequential triangulation of orbital photography

The feasibility of structuring the satellite photogrammetric triangulation as an iterative Extended Kalman estimation algorithm is demonstrated. Comparative numerical results of the sequential against batch estimation algorithm are presented. Difficulty of accurately modeling of the attitude motion is overcome by utilizing the on-board angular rate measurements. Solutions of the differential equations and the evaluation of state transition matrix are carried out numerically.

Rajan, M.↗

Evaluation of Bayesian Sequential Proportion Estimation Using Analyst Labels

The author has identified the following significant results. A total of ten Large Area Crop Inventory Experiment Phase 3 blind sites and analyst-interpreter labels were used in a study to compare proportional estimates obtained by the Bayes sequential procedure with estimates obtained from simple random sampling and from Procedure 1. The analyst error rate using the Bayes technique was shown to be no greater than that for the simple random sampling. Also, the segment proportion estimates produced using this technique had smaller bias and mean squared errors than the estimates produced using either simple random sampling or Procedure 1.

Lennington, R. K.↗

Sequential-Impulse Generator Uses Fiber-Optics

Light pulse from a ruby or neodymium-glass laser enters miniature optics of repetitive-detonation apparatus. Traveling along a bundle of optical fibers, light strikes laser-sensitive microdetonator and charge explodes. Apparatus then advances next charge in train into position. Possible applications of sequential-impulse generator are in creating shock waves for aerodynamics research and in generating electrical power by magnetohydrodynamics.

Yang, L. C.↗