An analysis of sequential filtering for estimating the state of a planetary orbiter
Batch and sequential consider filters data processing methods for Mars orbiting spacecraft state estimation, investigating error sources
Curkendall, D. W.↗
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.
On erroneous prediction of the performance of sequential processors with linear methods
Sequential processor performance prediction error with linear method from Monte Carlo cycle analysis of Apollo 14 early rendezvous profile
Bond, A. C.↗
Piezoelectric actuator uses sequentially-excited multiple elements: A concept
Utilizing arrays of sequentially-excited piezoelectric elements to provide motion in a nonmagnetic motor provide built-in redundancy and long life required for deployment or actuation of devices on spacecraft. Linear-motion motor devices can also be fabricated.
Sabelman, E. E.↗
High speed sequential decoder
Operation of sequential decoding of data at high rates using Fano algorithm is discussed. Actions followed by decoder in systematically searching branches are described. Technique of diagonal steps is explained and illustrated.
Gilhousen, K. S.↗
Some sequential, distribution-free pattern classification procedures with applications
Some sequential, distribution-free pattern classification techniques are presented. The decision problem to which the proposed classification methods are applied is that of discriminating between two kinds of electroencephalogram responses recorded from a human subject: spontaneous EEG and EEG driven by a stroboscopic light stimulus at the alpha frequency. The classification procedures proposed make use of the theory of order statistics. Estimates of the probabilities of misclassification are given. The procedures were tested on Gaussian samples and the EEG responses.
Poage, J. L.↗
Study of sequential decoding
Sequential decoding problems considered deal with reliable transmission through noise space channels and encoding of space sources for the purpose of data suppression.
Jelinek, F.↗
Kullback-Leibler information function and the sequential selection of experiments to discriminate among several linear models
The error variance of the process prior multivariate normal distributions of the parameters of the models are assumed to be specified, prior probabilities of the models being correct. A rule for termination of sampling is proposed. Upon termination, the model with the largest posterior probability is chosen as correct. If sampling is not terminated, posterior probabilities of the models and posterior distributions of the parameters are computed. An experiment was chosen to maximize the expected Kullback-Leibler information function. Monte Carlo simulation experiments were performed to investigate large and small sample behavior of the sequential adaptive procedure.
Sidik, S. M.↗
Nonsystematic convolutional codes for sequential decoding in space applications.
Description of a class of rate 1/2 nonsystematic convolutional codes with the following desirable properties: (1) an undetected decoding error probability verified by simulation to be much smaller than for the best systematic codes of the same constraint length; (2) computation behavior with sequential decoding verified by simulation to be virtually identical to that of the best systematic codes; (3) a ?quick-look-in' feature that permits recovery of the information sequence from the hard-decisioned received data without decoding simply by modulo-two addition of the received sequences; and (4) suitability for encoding by simple circuitry requiring less hardware than encoders for the best systematic codes of the same constraint length. Theoretical analyses are given. These codes have been adopted for use in several forthcoming space missions.
Massey, J. L.↗
A flexible high-speed sequential decoder for deep space channels.
This paper describes a sequential decoding machine built at the Jet Propulsion Laboratory (JPL), which uses a 3-bit quantization of the code symbols and achieves a computation rate of MHz. This machine is flexible and can be programmed to decode any complementary convolutional code with rates down to 1/4 and constraint lengths up to 32. In addition, metric programmability is provided for optimization of decoder performance with respect to channel parameter variations.
Layland, J. W.↗
Sequential error detection for nonlinear estimators.
A method is presented for sequentially testing the consistency of actual and calculated error covariances in recursive nonlinear estimators, such as the extended Kalman filter. An equivalent simplified test is described briefly. The method is useful for linear filters as well, where inconsistencies may be caused by modeling inaccuracies.
Nahi, N. E.↗
Finite group homomorphic sequential systems.
A class of finite-state sequential systems evolving in groups is considered. It represents a broader class of input-output relations than those found in linear system theory. The concepts of controllability, observability, minimality, realizability, and the isomorphism of minimal realizations are developed. Results that are analogous to, but differ in essential details from, those of linear system theory are derived. Algorithmic design and algebraic decoding may benefit from these results.
Brockett, R. W.↗
Semi-automatic crop inventory from sequential ERTS-1 imagery
Semi-automatic crop inventory from sequential ERTS-1 imagery for Imperial Valley, California
Johnson, C. W.↗
A high speed sequential decoder
The performance and theory of operation for the High Speed Hard Decision Sequential Decoder are delineated. The decoder is a forward error correction system which is capable of accepting data from binary-phase-shift-keyed and quadriphase-shift-keyed modems at input data rates up to 30 megabits per second. Test results show that the decoder is capable of maintaining a composite error rate of 0.00001 at an input E sub b/N sub o of 5.6 db. This performance has been obtained with minimum circuit complexity.
Lum, H., Jr.↗
Semi-automatic crop inventory from sequential ERTS-1 imagery
The detection of a newly introduced crop into the Imperial (California) Valley by sequential ERTS-1 imagery is proving that individual crop types can be identified by remote sensing techniques. Initial results have provided an extremely useful product for water agencies. A system for the identification of field conditions enables the production of a statistical summary within two to three days of receipt of the ERTS-1 imagery. The summary indicates the total acreage of producing crops and irrigated planted crops currently demanding water and further indicates freshly plowed fields that will be demanding water in the near future. Relating the field conditions to the crop calendar of the region by means of computer techniques will provide specific crop identification for the 8000 plus fields.
Johnson, C. W.↗
Forced guidance and distribution of practice in sequential information processing.
Distribution of practice and forced guidance were used in a sequential information-processing task in an attempt to increase the capacity of human information-processing mechanisms. A reaction time index of the psychological refractory period was used as the response measure. Massing of practice lengthened response times while forced guidance shortened them. Interpretation was in terms of load reduction upon the response-selection stage of the information-processing system.-
Decker, L. R.↗
Search properties of some sequential decoding algorithms.
Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered, and their properties are compared. It is shown that the stack algorithm introduced by Zigangirov (1966) and by Jelinek (1969) is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different. A modified Fano algorithm is introduced, in which the quantizing parameter is eliminated. It can be inferred from limited simulation results that, at least in some applications, the new algorithm is computationally inferior to the old. However, it is of some theoretical interest since the conventional Fano algorithm may be considered to be a quantized version of it.
Geist, J. M.↗
On-line diagnosis of sequential systems
A model for on-line diagnosis was investigated for discrete-time systems, and resettable sequential systems. Generalized notions of a realization are discussed along with fault tolerance and errors. Further investigation into the theory of on-line diagnosis is recommended for three levels: binary state-assigned level, logical circuit level, and the subsystem-network level.
Sundstrom, R. J.↗
On-line diagnosis of sequential systems, 2
The theory and techniques applicable to the on-line diagnosis of sequential systems, were investigated. A complete model for the study of on-line diagnosis is developed. First an appropriate class of system models is formulated which can serve as a basis for a theoretical study of on-line diagnosis. Then notions of realization, fault, fault-tolerance and diagnosability are formalized which have meaningful interpretations in the the context of on-line diagnosis. The diagnosis of systems which are structurally decomposed and are represented as a network of smaller systems is studied. The fault set considered is the set of faults which only affect one component system is the network. A characterization of those networks which can be diagnosed using a purely combinational detector is achieved. A technique is given which can be used to realize any network by a network which is diagnosable in the above sense. Limits are found on the amount of redundancy involved in any such technique.
Sundstrom, R. J.↗