An optimal multistage Kalman estimator (OMSKE) is proposed as a generalization of the optimal two-stage Kalman estimator for the reduction of the computational burden of the Kalman estimator (KE) for discrete-time linear time-varying systems with triangular transition matrices. This new filter is obtained by applying a multistage transformation to decouple the covariances of the KE. It is shown...

Randomly-wired multistage networks have recently been shown to outperform traditional multistage networks in three respects. First, they have fast deterministic packet-switching and circuit-switching algorithms for routing permutations. Second, they are nonblocking, and there are on-line algorithms for establishing new connections in them, even if many requests for connections are made simultan...

A general multistage (stepwise) procedure is proposed for dealing with arbitrary gatekeeping problems including parallel and serial gatekeeping. The procedure is very simple to implement since it does not require the application of the closed testing principle and the consequent need to test all nonempty intersections of hypotheses. It is based on the idea of carrying forward the Type I error r...

Conventional multiple hypothesis tests use step-up, step-down, or closed testing methods to control the overall error rates. We will discuss marrying these methods with adaptive multistage sampling rules and stopping rules to perform efficient multiple hypothesis testing in sequential experimental designs. The result is a multistage step-down procedure that adaptively tests multiple hypotheses ...

Reliability and performance of interconnection network systems significantly depends on the interconnection of its components, among other factors. The interconnection among switches, number of stages, and the types of switches normally determine the system configuration. System performance could be analyzed based on its redundant paths, information transition time, and its reliability. As the ...

from that of Gaussian. It may be noted that this characteristic of pseudo-error detectors was predicted by G ~ o d i n g (~) and may now be regarded as being confirmed.' Scrutiny of Figures 8, 9 and 10 indicates that the achieved stability of the multiplication factor is sufficient to estimate BER from the pseudo-error rate with an accuracy of about a factor of 10 in BER. In addition, the estim...

We present a probabilistic framework for combining classifiers. Each classifier stage may be based on different data (e.g. astrometry, BP/RP spectrum, G-magnitude, Galactic latitude) or types of object (Galactic, extragalactic). Different data types have differing degrees of power in determining the classes. We present two types of combination. The first uses simple probability theory to combin...

In this paper, we present a new multiple stage vector quantization method that allows the adaptation of the quantizer to signal to be coded. This adaptation is computationally very simple and is made with no increase in bit-rate. The resul t ing quant izer prov ides a robust performance across different speakers and environments. I t has been applied to the quantization of the LPC parameters an...

This paper investigates the use of a new hybrid vector quantizer called switched multistage vector quantization (SWMSVQ) technique using hard and soft decision schemes, for coding of narrow band speech signals. This technique is a hybrid of switch vector quantization technique and multistage vector quantization technique. SWMSVQ quantizes the linear predictive coefficients (LPC) in terms of the...